%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ153+1 : TPTP v9.1.0. Released v9.1.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Apr 1 01:59:45 AM UTC 2025 % Result : CounterSatisfiable 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : PUZ153+1 : TPTP v9.1.0. Released v9.1.0. % 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n010.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Mar 31 10:58:56 EDT 2025 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 11 Number of unprocessed: 11 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 11 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 4 conjectures. % 0.12/0.37 # There are 4 start rule candidates: % 0.12/0.37 # Found 6 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 4 start rule tableaux created. % 0.12/0.37 # 5 extension rule candidate clauses % 0.12/0.37 # 6 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 17 tableaux to operate on % 0.12/0.37 # 1860 Satisfiable branch % 0.12/0.37 # Satisfiable branch found. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_3, plain, (grade_of(john)=f)). % 0.12/0.37 cnf(i_0_2, plain, (human(john))). % 0.12/0.37 cnf(i_0_5, plain, (human(esk1_0))). % 0.12/0.37 cnf(i_0_4, plain, (grade_of(esk1_0)=a)). % 0.12/0.37 cnf(i_0_6, plain, (a!=f)). % 0.12/0.37 cnf(i_0_7, plain, (~human(grade_of(X1)))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (esk2_0=esk3_0|human(esk2_0))). % 0.12/0.37 cnf(i_0_9, negated_conjecture, (esk2_0=esk3_0|human(esk3_0))). % 0.12/0.37 cnf(i_0_8, negated_conjecture, (esk2_0=esk3_0|created_equal(esk2_0,esk3_0))). % 0.12/0.37 cnf(i_0_11, negated_conjecture, (esk2_0!=esk3_0|~created_equal(esk2_0,esk3_0)|~human(esk2_0)|~human(esk3_0))). % 0.12/0.37 cnf(i_0_1, plain, (created_equal(X1,X2)|~human(X2)|~human(X1))). % 0.12/0.37 cnf(i_0_204, plain, (X11=X11)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_3, plain, (grade_of(john)=f), inference(start_rule)). % 0.12/0.37 cnf(i_0_211, plain, (grade_of(john)=f), inference(extension_rule, [i_0_208])). % 0.12/0.37 cnf(i_0_251, plain, (human(f)), inference(extension_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_262, plain, (~human(john)), inference(closure_rule, [i_0_2])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # 1858 Satisfiable branch % 0.12/0.37 # 1859 Satisfiable branch % 0.12/0.37 # Child (1860) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------