%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.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 : n004.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:00:40 PM UTC 2026 % Result : Unsatisfiable 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.34 % Computer : n004.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sat Sep 5 00:24:29 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 17 Number of unprocessed: 15 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 15 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 15 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 15 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 28 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 28 tableaux to operate on % 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 1 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 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_33, plain, (not(truth)=falsehood)). % 0.12/0.37 cnf(i_0_18, plain, (implies(truth,X1)=X1)). % 0.12/0.37 cnf(i_0_22, plain, (implies(not(X1),X2)=or(X1,X2))). % 0.12/0.37 cnf(i_0_23, plain, (or(or(X1,X2),X3)=or(X1,or(X2,X3)))). % 0.12/0.37 cnf(i_0_31, plain, (and_star(and_star(X1,X2),X3)=and_star(X1,and_star(X2,X3)))). % 0.12/0.37 cnf(i_0_30, plain, (and(X1,X2)=and_star(X1,X2))). % 0.12/0.37 cnf(i_0_25, plain, (not(or(not(X1),not(X2)))=and_star(X1,X2))). % 0.12/0.37 cnf(i_0_21, plain, (implies(or(X1,not(X2)),implies(X2,X1))=truth)). % 0.12/0.37 cnf(i_0_28, plain, (or(and_star(X1,not(X2)),and_star(not(X1),X2))=xor(X1,X2))). % 0.12/0.37 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)). % 0.12/0.37 cnf(i_0_24, plain, (or(X1,X2)=or(X2,X1))). % 0.12/0.37 cnf(i_0_29, plain, (xor(X1,X2)=xor(X2,X1))). % 0.12/0.37 cnf(i_0_32, plain, (and_star(X1,X2)=and_star(X2,X1))). % 0.12/0.37 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))). % 0.12/0.37 cnf(i_0_34, negated_conjecture, (xor(falsehood,x)!=x)). % 0.12/0.37 cnf(i_0_36, plain, (X4=X4)). % 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 6 steps % 0.12/0.37 cnf(i_0_33, plain, (not(truth)=falsehood), inference(start_rule)). % 0.12/0.37 cnf(i_0_46, plain, (not(truth)=falsehood), inference(extension_rule, [i_0_42])). % 0.12/0.37 cnf(i_0_76, plain, (not(truth)!=falsehood), inference(closure_rule, [i_0_33])). % 0.12/0.37 cnf(i_0_74, plain, (or(not(truth),not(truth))=or(falsehood,falsehood)), inference(extension_rule, [i_0_39])). % 0.12/0.37 cnf(i_0_92, plain, (or(falsehood,falsehood)!=implies(truth,or(falsehood,falsehood))), inference(closure_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_90, plain, (or(not(truth),not(truth))=implies(truth,or(falsehood,falsehood))), inference(etableau_closure_rule, [i_0_90, ...])). % 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.38 # Child (2069144) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------