%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL400-10 : TPTP v9.3.1. Released v7.5.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:01:10 PM UTC 2026 % Result : Unsatisfiable 76.09s 10.06s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL400-10 : TPTP v9.3.1. Released v7.5.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.35 % Computer : n020.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Sat Sep 5 06:18:27 UTC 2026 % 0.10/0.35 % CPUTime : % 0.13/0.40 # No SInE strategy applied % 0.13/0.40 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.40 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.40 # % 0.13/0.40 # Number of axioms: 6 Number of unprocessed: 6 % 0.13/0.40 # Tableaux proof search. % 0.13/0.40 # APR header successfully linked. % 0.13/0.40 # Hello from C++ % 0.13/0.41 # The folding up rule is enabled... % 0.13/0.41 # Local unification is enabled... % 0.13/0.41 # Any saturation attempts will use folding labels... % 0.13/0.41 # 6 beginning clauses after preprocessing and clausification % 0.13/0.41 # Creating start rules for all 1 conjectures. % 0.13/0.41 # There are 1 start rule candidates: % 0.13/0.41 # Found 6 unit axioms. % 0.13/0.41 # 1 start rule tableaux created. % 0.13/0.41 # 0 extension rule candidate clauses % 0.13/0.41 # 6 unit axiom clauses % 0.13/0.41 % 0.13/0.41 # Requested 8, 32 cores available to the main process. % 0.13/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.41 # Creating equality axioms % 0.13/0.41 # Ran out of tableaux, making start rules for all clauses % 0.13/0.41 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.13/0.41 # We now have 16 tableaux to operate on % 76.09/10.06 # There were 1 total branch saturation attempts. % 76.09/10.06 # There were 0 of these attempts blocked. % 76.09/10.06 # There were 0 deferred branch saturation attempts. % 76.09/10.06 # There were 0 free duplicated saturations. % 76.09/10.06 # There were 1 total successful branch saturations. % 76.09/10.06 # There were 0 successful branch saturations in interreduction. % 76.09/10.06 # There were 0 successful branch saturations on the branch. % 76.09/10.06 # There were 1 successful branch saturations after the branch. % 76.09/10.06 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 76.09/10.06 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 76.09/10.06 # Begin clausification derivation % 76.09/10.06 % 76.09/10.06 # End clausification derivation % 76.09/10.06 # Begin listing active clauses obtained from FOF to CNF conversion % 76.09/10.06 cnf(i_0_11, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))=true)). % 76.09/10.06 cnf(i_0_10, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))=true)). % 76.09/10.06 cnf(i_0_12, negated_conjecture, (is_a_theorem(implies(not(implies(x,y)),x))!=true)). % 76.09/10.06 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 76.09/10.06 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))=true)). % 76.09/10.06 cnf(i_0_8, plain, (ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)). % 76.09/10.06 cnf(i_0_14, plain, (X4=X4)). % 76.09/10.06 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 76.09/10.06 # Begin printing tableau % 76.09/10.06 # Found 8 steps % 76.09/10.06 cnf(i_0_11, plain, (is_a_theorem(implies(X22,implies(not(X22),X21)))=true), inference(start_rule)). % 76.09/10.06 cnf(i_0_22, plain, (is_a_theorem(implies(X22,implies(not(X22),X21)))=true), inference(extension_rule, [i_0_18])). % 76.09/10.06 cnf(i_0_37, plain, (is_a_theorem(implies(true,implies(not(true),true)))!=true), inference(closure_rule, [i_0_11])). % 76.09/10.06 cnf(i_0_39, plain, (is_a_theorem(implies(true,implies(not(true),true)))!=true), inference(closure_rule, [i_0_11])). % 76.09/10.06 cnf(i_0_40, plain, (is_a_theorem(implies(true,implies(not(true),true)))!=true), inference(closure_rule, [i_0_11])). % 76.09/10.06 cnf(i_0_36, plain, (ifeq(is_a_theorem(implies(true,implies(not(true),true))),is_a_theorem(implies(X22,implies(not(X22),X21))),is_a_theorem(implies(true,implies(not(true),true))),is_a_theorem(implies(true,implies(not(true),true))))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_17])). % 76.09/10.06 cnf(i_0_54, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 76.09/10.06 cnf(i_0_52, plain, (ifeq(is_a_theorem(implies(true,implies(not(true),true))),is_a_theorem(implies(X22,implies(not(X22),X21))),is_a_theorem(implies(true,implies(not(true),true))),is_a_theorem(implies(true,implies(not(true),true))))=true), inference(etableau_closure_rule, [i_0_52, ...])). % 76.09/10.06 # End printing tableau % 76.09/10.06 # SZS output end % 76.09/10.06 # Branches closed with saturation will be marked with an "s" % 76.09/10.10 # Child (1886645) has found a proof. % 76.09/10.10 % 76.09/10.10 # Proof search is over... % 76.09/10.10 # Freeing feature tree %------------------------------------------------------------------------------