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