%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL218-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 : n001.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:50 PM UTC 2026 % Result : Unsatisfiable 7.87s 1.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.04 % Problem : LCL218-10 : TPTP v9.3.1. Released v7.3.0. % 0.00/0.05 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.42 % Computer : n001.cluster.edu % 0.13/0.42 % Model : x86_64 x86_64 % 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.42 % Memory : 8046.5625MB % 0.13/0.42 % OS : Linux 6.8.0-71-generic % 0.13/0.42 % CPULimit : 300 % 0.13/0.42 % WCLimit : 300 % 0.13/0.42 % DateTime : Fri Sep 4 12:47:29 UTC 2026 % 0.13/0.42 % CPUTime : % 0.13/0.45 # No SInE strategy applied % 0.13/0.45 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.45 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.45 # % 0.13/0.45 # Presaturation interreduction done % 0.13/0.45 # Number of axioms: 10 Number of unprocessed: 10 % 0.13/0.45 # Tableaux proof search. % 0.13/0.45 # APR header successfully linked. % 0.13/0.45 # Hello from C++ % 0.13/0.45 # The folding up rule is enabled... % 0.13/0.45 # Local unification is enabled... % 0.13/0.45 # Any saturation attempts will use folding labels... % 0.13/0.45 # 10 beginning clauses after preprocessing and clausification % 0.13/0.45 # Creating start rules for all 1 conjectures. % 0.13/0.45 # There are 1 start rule candidates: % 0.13/0.45 # Found 10 unit axioms. % 0.13/0.45 # 1 start rule tableaux created. % 0.13/0.45 # 0 extension rule candidate clauses % 0.13/0.45 # 10 unit axiom clauses % 0.13/0.45 % 0.13/0.45 # Requested 8, 32 cores available to the main process. % 0.13/0.45 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.45 # Creating equality axioms % 0.13/0.45 # Ran out of tableaux, making start rules for all clauses % 0.13/0.45 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.13/0.45 # We now have 20 tableaux to operate on % 7.87/1.60 # There were 1 total branch saturation attempts. % 7.87/1.60 # There were 0 of these attempts blocked. % 7.87/1.60 # There were 0 deferred branch saturation attempts. % 7.87/1.60 # There were 0 free duplicated saturations. % 7.87/1.60 # There were 1 total successful branch saturations. % 7.87/1.60 # There were 0 successful branch saturations in interreduction. % 7.87/1.60 # There were 0 successful branch saturations on the branch. % 7.87/1.60 # There were 1 successful branch saturations after the branch. % 7.87/1.60 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.87/1.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.87/1.60 # Begin clausification derivation % 7.87/1.60 % 7.87/1.60 # End clausification derivation % 7.87/1.60 # Begin listing active clauses obtained from FOF to CNF conversion % 7.87/1.60 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)). % 7.87/1.60 cnf(i_0_13, plain, (axiom(or(not(X1),or(X2,X1)))=true)). % 7.87/1.60 cnf(i_0_12, plain, (axiom(or(not(or(X1,X1)),X1))=true)). % 7.87/1.60 cnf(i_0_17, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)). % 7.87/1.60 cnf(i_0_14, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)). % 7.87/1.60 cnf(i_0_15, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)). % 7.87/1.60 cnf(i_0_16, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)). % 7.87/1.60 cnf(i_0_18, plain, (ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true)=true)). % 7.87/1.60 cnf(i_0_19, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true)=true)). % 7.87/1.60 cnf(i_0_20, negated_conjecture, (theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))!=true)). % 7.87/1.60 cnf(i_0_22, plain, (X4=X4)). % 7.87/1.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.87/1.60 # Begin printing tableau % 7.87/1.60 # Found 6 steps % 7.87/1.60 cnf(i_0_11, plain, (ifeq(X10,X10,X5,X8)=X5), inference(start_rule)). % 7.87/1.60 cnf(i_0_31, plain, (ifeq(X10,X10,X5,X8)=X5), inference(extension_rule, [i_0_27])). % 7.87/1.60 cnf(i_0_56, plain, (ifeq(X1,X1,X7,X3)!=X7), inference(closure_rule, [i_0_11])). % 7.87/1.60 cnf(i_0_54, plain, (or(ifeq(X10,X10,X5,X8),ifeq(X1,X1,X7,X3))=or(X5,X7)), inference(extension_rule, [i_0_25])). % 7.87/1.60 cnf(i_0_69, plain, (or(X5,X7)!=ifeq(X1,X1,or(X5,X7),X3)), inference(closure_rule, [i_0_11])). % 7.87/1.60 cnf(i_0_67, plain, (or(ifeq(X10,X10,X5,X8),ifeq(X1,X1,X7,X3))=ifeq(X1,X1,or(X5,X7),X3)), inference(etableau_closure_rule, [i_0_67, ...])). % 7.87/1.60 # End printing tableau % 7.87/1.60 # SZS output end % 7.87/1.60 # Branches closed with saturation will be marked with an "s" % 7.87/1.60 # Child (1041815) has found a proof. % 7.87/1.60 % 7.87/1.60 # Proof search is over... % 7.87/1.60 # Freeing feature tree %------------------------------------------------------------------------------