%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL211-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 : n011.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:49 PM UTC 2026 % Result : Unsatisfiable 3.37s 1.04s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL211-10 : TPTP v9.3.1. Released v7.5.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.42 % Computer : n011.cluster.edu % 0.09/0.42 % Model : x86_64 x86_64 % 0.09/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.42 % Memory : 8046.5625MB % 0.09/0.42 % OS : Linux 6.8.0-71-generic % 0.09/0.42 % CPULimit : 300 % 0.09/0.42 % WCLimit : 300 % 0.09/0.42 % DateTime : Sat Sep 5 05:04:13 UTC 2026 % 0.09/0.42 % CPUTime : % 0.09/0.45 # No SInE strategy applied % 0.09/0.45 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.09/0.45 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.09/0.45 # % 0.09/0.45 # Number of axioms: 9 Number of unprocessed: 9 % 0.09/0.45 # Tableaux proof search. % 0.09/0.45 # APR header successfully linked. % 0.09/0.45 # Hello from C++ % 0.09/0.45 # The folding up rule is enabled... % 0.09/0.45 # Local unification is enabled... % 0.09/0.45 # Any saturation attempts will use folding labels... % 0.09/0.45 # 9 beginning clauses after preprocessing and clausification % 0.09/0.45 # Creating start rules for all 1 conjectures. % 0.09/0.45 # There are 1 start rule candidates: % 0.09/0.45 # Found 9 unit axioms. % 0.09/0.45 # 1 start rule tableaux created. % 0.09/0.45 # 0 extension rule candidate clauses % 0.09/0.45 # 9 unit axiom clauses % 0.09/0.45 % 0.09/0.45 # Requested 8, 32 cores available to the main process. % 0.09/0.45 # There are not enough tableaux to fork, creating more from the initial 1 % 0.09/0.45 # Creating equality axioms % 0.09/0.45 # Ran out of tableaux, making start rules for all clauses % 0.09/0.45 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.09/0.45 # We now have 20 tableaux to operate on % 3.37/1.04 # There were 1 total branch saturation attempts. % 3.37/1.04 # There were 0 of these attempts blocked. % 3.37/1.04 # There were 0 deferred branch saturation attempts. % 3.37/1.04 # There were 0 free duplicated saturations. % 3.37/1.04 # There were 1 total successful branch saturations. % 3.37/1.04 # There were 0 successful branch saturations in interreduction. % 3.37/1.04 # There were 0 successful branch saturations on the branch. % 3.37/1.04 # There were 1 successful branch saturations after the branch. % 3.37/1.04 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.37/1.04 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.37/1.04 # Begin clausification derivation % 3.37/1.04 % 3.37/1.04 # End clausification derivation % 3.37/1.04 # Begin listing active clauses obtained from FOF to CNF conversion % 3.37/1.04 cnf(i_0_13, plain, (axiom(or(not(X1),or(X2,X1)))=true)). % 3.37/1.04 cnf(i_0_12, plain, (axiom(or(not(or(X1,X1)),X1))=true)). % 3.37/1.04 cnf(i_0_14, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)). % 3.37/1.04 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)). % 3.37/1.04 cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)). % 3.37/1.04 cnf(i_0_20, negated_conjecture, (theorem(or(not(not(q)),or(not(or(p,q)),p)))!=true)). % 3.37/1.04 cnf(i_0_15, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)). % 3.37/1.04 cnf(i_0_16, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)). % 3.37/1.04 cnf(i_0_19, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)). % 3.37/1.04 cnf(i_0_22, plain, (X4=X4)). % 3.37/1.04 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.37/1.04 # Begin printing tableau % 3.37/1.04 # Found 7 steps % 3.37/1.04 cnf(i_0_13, plain, (axiom(or(not(X20),or(X19,X20)))=true), inference(start_rule)). % 3.37/1.04 cnf(i_0_31, plain, (axiom(or(not(X20),or(X19,X20)))=true), inference(extension_rule, [i_0_30])). % 3.37/1.04 cnf(i_0_60, plain, (theorem(axiom(or(not(X20),or(X19,X20))))=theorem(true)), inference(extension_rule, [i_0_26])). % 3.37/1.04 cnf(i_0_148, plain, (axiom(or(not(X1),or(X2,X1)))!=true), inference(closure_rule, [i_0_13])). % 3.37/1.04 cnf(i_0_149, plain, (axiom(or(not(X1),or(X2,X1)))!=true), inference(closure_rule, [i_0_13])). % 3.37/1.04 cnf(i_0_150, plain, (axiom(or(not(X1),or(X2,X1)))!=true), inference(closure_rule, [i_0_13])). % 3.37/1.04 cnf(i_0_146, plain, (ifeq(theorem(axiom(or(not(X20),or(X19,X20)))),axiom(or(not(X1),or(X2,X1))),axiom(or(not(X1),or(X2,X1))),axiom(or(not(X1),or(X2,X1))))=ifeq(theorem(true),true,true,true)), inference(etableau_closure_rule, [i_0_146, ...])). % 3.37/1.04 # End printing tableau % 3.37/1.04 # SZS output end % 3.37/1.04 # Branches closed with saturation will be marked with an "s" % 3.37/1.05 # Child (501659) has found a proof. % 3.37/1.05 % 3.37/1.05 # Proof search is over... % 3.37/1.05 # Freeing feature tree %------------------------------------------------------------------------------