%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL203-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 : n002.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:47 PM UTC 2026 % Result : Unsatisfiable 5.29s 1.10s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL203-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 : n002.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 : Sun Sep 6 00:38:06 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 9 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 1 conjectures. % 0.13/0.39 # There are 1 start rule candidates: % 0.13/0.39 # Found 9 unit axioms. % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 0 extension rule candidate clauses % 0.13/0.39 # 9 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.39 # Creating equality axioms % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 20 tableaux to operate on % 5.29/1.10 # There were 1 total branch saturation attempts. % 5.29/1.10 # There were 0 of these attempts blocked. % 5.29/1.10 # There were 0 deferred branch saturation attempts. % 5.29/1.10 # There were 0 free duplicated saturations. % 5.29/1.10 # There were 1 total successful branch saturations. % 5.29/1.10 # There were 0 successful branch saturations in interreduction. % 5.29/1.10 # There were 0 successful branch saturations on the branch. % 5.29/1.10 # There were 1 successful branch saturations after the branch. % 5.29/1.10 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.29/1.10 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.29/1.10 # Begin clausification derivation % 5.29/1.10 % 5.29/1.10 # End clausification derivation % 5.29/1.10 # Begin listing active clauses obtained from FOF to CNF conversion % 5.29/1.10 cnf(i_0_13, plain, (axiom(or(not(X1),or(X2,X1)))=true)). % 5.29/1.10 cnf(i_0_12, plain, (axiom(or(not(or(X1,X1)),X1))=true)). % 5.29/1.10 cnf(i_0_14, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)). % 5.29/1.10 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)). % 5.29/1.10 cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)). % 5.29/1.10 cnf(i_0_20, negated_conjecture, (theorem(or(not(not(or(p,q))),or(not(p),not(q))))!=true)). % 5.29/1.10 cnf(i_0_15, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)). % 5.29/1.10 cnf(i_0_16, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)). % 5.29/1.10 cnf(i_0_19, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)). % 5.29/1.10 cnf(i_0_22, plain, (X4=X4)). % 5.29/1.10 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.29/1.10 # Begin printing tableau % 5.29/1.10 # Found 6 steps % 5.29/1.10 cnf(i_0_13, plain, (axiom(or(not(X10),or(X9,X10)))=true), inference(start_rule)). % 5.29/1.10 cnf(i_0_31, plain, (axiom(or(not(X10),or(X9,X10)))=true), inference(extension_rule, [i_0_27])). % 5.29/1.10 cnf(i_0_54, plain, (axiom(or(not(X1),or(or(true,true),X1)))!=true), inference(closure_rule, [i_0_13])). % 5.29/1.10 cnf(i_0_53, plain, (or(axiom(or(not(X1),or(or(true,true),X1))),axiom(or(not(X10),or(X9,X10))))=or(true,true)), inference(extension_rule, [i_0_25])). % 5.29/1.10 cnf(i_0_68, plain, (or(true,true)!=ifeq(X1,X1,or(true,true),X3)), inference(closure_rule, [i_0_11])). % 5.29/1.10 cnf(i_0_66, plain, (or(axiom(or(not(X1),or(or(true,true),X1))),axiom(or(not(X10),or(X9,X10))))=ifeq(X1,X1,or(true,true),X3)), inference(etableau_closure_rule, [i_0_66, ...])). % 5.29/1.10 # End printing tableau % 5.29/1.10 # SZS output end % 5.29/1.10 # Branches closed with saturation will be marked with an "s" % 5.29/1.10 # Child (3454166) has found a proof. % 5.29/1.10 % 5.29/1.10 # Proof search is over... % 5.29/1.10 # Freeing feature tree %------------------------------------------------------------------------------