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