%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL143-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 : n012.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.03s 0.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL143-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.03/0.29 % Computer : n012.cluster.edu % 0.03/0.29 % Model : x86_64 x86_64 % 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.29 % Memory : 8046.5625MB % 0.03/0.29 % OS : Linux 6.8.0-71-generic % 0.03/0.29 % CPULimit : 300 % 0.03/0.29 % WCLimit : 300 % 0.03/0.29 % DateTime : Fri Sep 4 23:44:27 UTC 2026 % 0.03/0.30 % CPUTime : % 0.03/0.31 # No SInE strategy applied % 0.03/0.31 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.03/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.03/0.31 # % 0.03/0.31 # Presaturation interreduction done % 0.03/0.31 # Number of axioms: 8 Number of unprocessed: 8 % 0.03/0.31 # Tableaux proof search. % 0.03/0.31 # APR header successfully linked. % 0.03/0.31 # Hello from C++ % 0.03/0.31 # The folding up rule is enabled... % 0.03/0.31 # Local unification is enabled... % 0.03/0.31 # Any saturation attempts will use folding labels... % 0.03/0.31 # 8 beginning clauses after preprocessing and clausification % 0.03/0.31 # Creating start rules for all 2 conjectures. % 0.03/0.31 # There are 2 start rule candidates: % 0.03/0.31 # Found 6 unit axioms. % 0.03/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.03/0.31 # 2 start rule tableaux created. % 0.03/0.31 # 2 extension rule candidate clauses % 0.03/0.31 # 6 unit axiom clauses % 0.03/0.31 % 0.03/0.31 # Requested 8, 32 cores available to the main process. % 0.03/0.31 # There are not enough tableaux to fork, creating more from the initial 2 % 0.03/0.31 # Creating equality axioms % 0.03/0.31 # Ran out of tableaux, making start rules for all clauses % 0.03/0.31 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.03/0.31 # We now have 10 tableaux to operate on % 0.03/0.31 # There were 1 total branch saturation attempts. % 0.03/0.31 # There were 0 of these attempts blocked. % 0.03/0.31 # There were 0 deferred branch saturation attempts. % 0.03/0.31 # There were 0 free duplicated saturations. % 0.03/0.31 # There were 1 total successful branch saturations. % 0.03/0.31 # There were 0 successful branch saturations in interreduction. % 0.03/0.31 # There were 0 successful branch saturations on the branch. % 0.03/0.31 # There were 1 successful branch saturations after the branch. % 0.03/0.31 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.31 # Begin clausification derivation % 0.03/0.31 % 0.03/0.31 # End clausification derivation % 0.03/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.03/0.31 cnf(i_0_19, negated_conjecture, (ordered(x,y))). % 0.03/0.31 cnf(i_0_11, plain, (implies(truth,X1)=X1)). % 0.03/0.31 cnf(i_0_14, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)). % 0.03/0.31 cnf(i_0_12, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)). % 0.03/0.31 cnf(i_0_13, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))). % 0.03/0.31 cnf(i_0_20, negated_conjecture, (~ordered(implies(z,x),implies(z,y)))). % 0.03/0.31 cnf(i_0_17, plain, (implies(X1,X2)=truth|~ordered(X1,X2))). % 0.03/0.31 cnf(i_0_18, plain, (ordered(X1,X2)|implies(X1,X2)!=truth)). % 0.03/0.31 cnf(i_0_39, plain, (X4=X4)). % 0.03/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.03/0.31 # Begin printing tableau % 0.03/0.31 # Found 5 steps % 0.03/0.31 cnf(i_0_19, negated_conjecture, (ordered(x,y)), inference(start_rule)). % 0.03/0.31 cnf(i_0_46, plain, (ordered(x,y)), inference(extension_rule, [i_0_17])). % 0.03/0.31 cnf(i_0_57, plain, (implies(x,y)=truth), inference(extension_rule, [i_0_43])). % 0.03/0.31 cnf(i_0_90, plain, (implies(truth,X4)!=X4), inference(closure_rule, [i_0_11])). % 0.03/0.31 cnf(i_0_88, plain, (implies(implies(x,y),implies(truth,X4))=implies(truth,X4)), inference(etableau_closure_rule, [i_0_88, ...])). % 0.03/0.31 # End printing tableau % 0.03/0.31 # SZS output end % 0.03/0.31 # Branches closed with saturation will be marked with an "s" % 0.03/0.31 # Child (1318400) has found a proof. % 0.03/0.31 % 0.03/0.31 # Proof search is over... % 0.03/0.31 # Freeing feature tree %------------------------------------------------------------------------------