%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL162-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 : n020.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:41 PM UTC 2026 % Result : Unsatisfiable 2.05s 0.67s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL162-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.10/0.36 % Computer : n020.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Fri Sep 4 19:21:12 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.38 # No SInE strategy applied % 0.10/0.38 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.10/0.38 # and selection function SelectNewComplexAHP. % 0.10/0.38 # % 0.10/0.38 # Presaturation interreduction done % 0.10/0.38 # Number of axioms: 14 Number of unprocessed: 14 % 0.10/0.38 # Tableaux proof search. % 0.10/0.38 # APR header successfully linked. % 0.10/0.38 # Hello from C++ % 0.10/0.38 # The folding up rule is enabled... % 0.10/0.38 # Local unification is enabled... % 0.10/0.38 # Any saturation attempts will use folding labels... % 0.10/0.38 # 14 beginning clauses after preprocessing and clausification % 0.10/0.38 # Creating start rules for all 1 conjectures. % 0.10/0.38 # There are 1 start rule candidates: % 0.10/0.38 # Found 14 unit axioms. % 0.10/0.38 # 1 start rule tableaux created. % 0.10/0.38 # 0 extension rule candidate clauses % 0.10/0.38 # 14 unit axiom clauses % 0.10/0.38 % 0.10/0.38 # Requested 8, 32 cores available to the main process. % 0.10/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.38 # Creating equality axioms % 0.10/0.38 # Ran out of tableaux, making start rules for all clauses % 0.10/0.38 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. % 0.10/0.38 # We now have 23 tableaux to operate on % 2.05/0.67 # There were 1 total branch saturation attempts. % 2.05/0.67 # There were 0 of these attempts blocked. % 2.05/0.67 # There were 0 deferred branch saturation attempts. % 2.05/0.67 # There were 0 free duplicated saturations. % 2.05/0.67 # There were 1 total successful branch saturations. % 2.05/0.67 # There were 0 successful branch saturations in interreduction. % 2.05/0.67 # There were 0 successful branch saturations on the branch. % 2.05/0.67 # There were 1 successful branch saturations after the branch. % 2.05/0.67 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.05/0.67 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.05/0.67 # Begin clausification derivation % 2.05/0.67 % 2.05/0.67 # End clausification derivation % 2.05/0.67 # Begin listing active clauses obtained from FOF to CNF conversion % 2.05/0.67 cnf(i_0_26, plain, (not(truth)=falsehood)). % 2.05/0.67 cnf(i_0_19, plain, (and_star(X1,falsehood)=falsehood)). % 2.05/0.67 cnf(i_0_16, plain, (xor(X1,falsehood)=X1)). % 2.05/0.67 cnf(i_0_18, plain, (and_star(X1,truth)=X1)). % 2.05/0.67 cnf(i_0_17, plain, (xor(X1,X1)=falsehood)). % 2.05/0.67 cnf(i_0_15, plain, (xor(X1,truth)=not(X1))). % 2.05/0.67 cnf(i_0_20, plain, (and_star(X1,xor(truth,X1))=falsehood)). % 2.05/0.67 cnf(i_0_24, plain, (and_star(and_star(X1,X2),X3)=and_star(X1,and_star(X2,X3)))). % 2.05/0.67 cnf(i_0_21, plain, (xor(X1,xor(truth,X2))=xor(not(X1),X2))). % 2.05/0.67 cnf(i_0_27, plain, (xor(truth,and_star(X1,xor(truth,X2)))=implies(X1,X2))). % 2.05/0.67 cnf(i_0_23, plain, (xor(X1,X2)=xor(X2,X1))). % 2.05/0.67 cnf(i_0_25, plain, (and_star(X1,X2)=and_star(X2,X1))). % 2.05/0.67 cnf(i_0_22, plain, (and_star(X1,not(and_star(xor(truth,X2),X1)))=and_star(X2,not(and_star(xor(truth,X1),X2))))). % 2.05/0.67 cnf(i_0_28, negated_conjecture, (implies(implies(x,y),implies(implies(y,z),implies(x,z)))!=truth)). % 2.05/0.67 cnf(i_0_30, plain, (X4=X4)). % 2.05/0.67 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.05/0.67 # Begin printing tableau % 2.05/0.67 # Found 5 steps % 2.05/0.67 cnf(i_0_26, plain, (not(truth)=falsehood), inference(start_rule)). % 2.05/0.67 cnf(i_0_38, plain, (not(truth)=falsehood), inference(extension_rule, [i_0_33])). % 2.05/0.67 cnf(i_0_58, plain, (not(truth)!=falsehood), inference(closure_rule, [i_0_26])). % 2.05/0.67 cnf(i_0_57, plain, (falsehood=falsehood), inference(extension_rule, [i_0_34])). % 2.05/0.67 cnf(i_0_134, plain, (not(falsehood)=not(falsehood)), inference(etableau_closure_rule, [i_0_134, ...])). % 2.05/0.67 # End printing tableau % 2.05/0.67 # SZS output end % 2.05/0.67 # Branches closed with saturation will be marked with an "s" % 2.05/0.67 # Child (1337125) has found a proof. % 2.05/0.67 % 2.05/0.68 # Proof search is over... % 2.05/0.68 # Freeing feature tree %------------------------------------------------------------------------------