%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.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 : n009.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:19 PM UTC 2026 % Result : Theorem 0.11s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.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.08/0.35 % Computer : n009.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 09:43:06 UTC 2026 % 0.08/0.35 % CPUTime : % 0.11/0.39 # No SInE strategy applied % 0.11/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.11/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.39 # % 0.11/0.39 # Presaturation interreduction done % 0.11/0.39 # Number of axioms: 74 Number of unprocessed: 60 % 0.11/0.39 # Tableaux proof search. % 0.11/0.39 # APR header successfully linked. % 0.11/0.39 # Hello from C++ % 0.11/0.40 # The folding up rule is enabled... % 0.11/0.40 # Local unification is enabled... % 0.11/0.40 # Any saturation attempts will use folding labels... % 0.11/0.40 # 60 beginning clauses after preprocessing and clausification % 0.11/0.40 # Creating start rules for all 1 conjectures. % 0.11/0.40 # There are 1 start rule candidates: % 0.11/0.40 # Found 26 unit axioms. % 0.11/0.40 # 1 start rule tableaux created. % 0.11/0.40 # 34 extension rule candidate clauses % 0.11/0.40 # 26 unit axiom clauses % 0.11/0.40 % 0.11/0.40 # Requested 8, 32 cores available to the main process. % 0.11/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.11/0.40 # Creating equality axioms % 0.11/0.40 # Ran out of tableaux, making start rules for all clauses % 0.11/0.40 # Returning from population with 60 new_tableaux and 0 remaining starting tableaux. % 0.11/0.40 # We now have 60 tableaux to operate on % 0.11/0.40 # There were 1 total branch saturation attempts. % 0.11/0.40 # There were 0 of these attempts blocked. % 0.11/0.40 # There were 0 deferred branch saturation attempts. % 0.11/0.40 # There were 0 free duplicated saturations. % 0.11/0.40 # There were 1 total successful branch saturations. % 0.11/0.40 # There were 0 successful branch saturations in interreduction. % 0.11/0.40 # There were 0 successful branch saturations on the branch. % 0.11/0.40 # There were 1 successful branch saturations after the branch. % 0.11/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.40 # Begin clausification derivation % 0.11/0.40 % 0.11/0.40 # End clausification derivation % 0.11/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.40 cnf(i_0_64, plain, (modus_ponens)). % 0.11/0.40 cnf(i_0_70, plain, (substitution_of_equivalents)). % 0.11/0.40 cnf(i_0_65, plain, (r1)). % 0.11/0.40 cnf(i_0_66, plain, (r2)). % 0.11/0.40 cnf(i_0_67, plain, (r3)). % 0.11/0.40 cnf(i_0_68, plain, (r4)). % 0.11/0.40 cnf(i_0_69, plain, (r5)). % 0.11/0.40 cnf(i_0_71, plain, (op_or)). % 0.11/0.40 cnf(i_0_62, plain, (op_and)). % 0.11/0.40 cnf(i_0_72, plain, (op_implies_and)). % 0.11/0.40 cnf(i_0_61, plain, (op_implies_or)). % 0.11/0.40 cnf(i_0_63, plain, (op_equiv)). % 0.11/0.40 cnf(i_0_59, plain, (or(not(X1),X2)=implies(X1,X2))). % 0.11/0.40 cnf(i_0_58, plain, (not(and(X1,not(X2)))=implies(X1,X2))). % 0.11/0.40 cnf(i_0_49, plain, (is_a_theorem(implies(X1,or(X2,X1))))). % 0.11/0.40 cnf(i_0_24, plain, (or_2)). % 0.11/0.40 cnf(i_0_47, plain, (is_a_theorem(implies(or(X1,X1),X1)))). % 0.11/0.40 cnf(i_0_57, plain, (not(implies(X1,not(X2)))=and(X1,X2))). % 0.11/0.40 cnf(i_0_56, plain, (implies(not(X1),X2)=or(X1,X2))). % 0.11/0.40 cnf(i_0_44, plain, (cn3)). % 0.11/0.40 cnf(i_0_60, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). % 0.11/0.40 cnf(i_0_51, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1))))). % 0.11/0.40 cnf(i_0_55, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))))). % 0.11/0.40 cnf(i_0_53, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))))). % 0.11/0.40 cnf(i_0_74, negated_conjecture, (~implies_1)). % 0.11/0.40 cnf(i_0_10, plain, (~is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0))))). % 0.11/0.40 cnf(i_0_7, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). % 0.11/0.40 cnf(i_0_22, plain, (or_1|~is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0))))). % 0.11/0.40 cnf(i_0_34, plain, (kn1|~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))))). % 0.11/0.40 cnf(i_0_16, plain, (and_1|~is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)))). % 0.11/0.40 cnf(i_0_18, plain, (and_2|~is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0)))). % 0.11/0.40 cnf(i_0_36, plain, (kn2|~is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0)))). % 0.11/0.40 cnf(i_0_4, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 0.11/0.40 cnf(i_0_35, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)). % 0.11/0.40 cnf(i_0_28, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))))). % 0.11/0.40 cnf(i_0_30, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0))))). % 0.11/0.40 cnf(i_0_20, plain, (and_3|~is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))))). % 0.11/0.40 cnf(i_0_23, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~or_1)). % 0.11/0.40 cnf(i_0_19, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)). % 0.11/0.40 cnf(i_0_17, plain, (is_a_theorem(implies(and(X1,X2),X1))|~and_1)). % 0.11/0.40 cnf(i_0_37, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2)). % 0.11/0.40 cnf(i_0_12, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))). % 0.11/0.40 cnf(i_0_31, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)). % 0.11/0.40 cnf(i_0_29, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)). % 0.11/0.40 cnf(i_0_42, plain, (cn2|~is_a_theorem(implies(esk42_0,or(esk42_0,esk43_0))))). % 0.11/0.40 cnf(i_0_43, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)). % 0.11/0.40 cnf(i_0_8, plain, (modus_tollens|~is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0))))). % 0.11/0.40 cnf(i_0_21, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)). % 0.11/0.40 cnf(i_0_14, plain, (implies_3|~is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0)))))). % 0.11/0.40 cnf(i_0_32, plain, (equivalence_3|~is_a_theorem(implies(implies(esk31_0,esk32_0),implies(implies(esk32_0,esk31_0),equiv(esk31_0,esk32_0)))))). % 0.11/0.40 cnf(i_0_40, plain, (cn1|~is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))))). % 0.11/0.40 cnf(i_0_9, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)). % 0.11/0.40 cnf(i_0_26, plain, (or_3|~is_a_theorem(implies(implies(esk24_0,esk26_0),implies(implies(esk25_0,esk26_0),implies(or(esk24_0,esk25_0),esk26_0)))))). % 0.11/0.40 cnf(i_0_38, plain, (kn3|~is_a_theorem(implies(implies(esk36_0,esk37_0),or(and(esk37_0,esk38_0),not(and(esk38_0,esk36_0))))))). % 0.11/0.40 cnf(i_0_13, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)). % 0.11/0.40 cnf(i_0_15, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)). % 0.11/0.40 cnf(i_0_41, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)). % 0.11/0.40 cnf(i_0_33, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)). % 0.11/0.40 cnf(i_0_27, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)). % 0.11/0.40 cnf(i_0_39, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)). % 0.11/0.40 cnf(i_0_145, plain, (X127=X127)). % 0.11/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.40 # Begin printing tableau % 0.11/0.40 # Found 6 steps % 0.11/0.40 cnf(i_0_59, plain, (or(not(X8),X7)=implies(X8,X7)), inference(start_rule)). % 0.11/0.40 cnf(i_0_167, plain, (or(not(X8),X7)=implies(X8,X7)), inference(extension_rule, [i_0_148])). % 0.11/0.40 cnf(i_0_512, plain, (or(not(X8),X7)!=implies(X8,X7)), inference(closure_rule, [i_0_59])). % 0.11/0.40 cnf(i_0_510, plain, (or(not(X8),X7)=or(not(X8),X7)), inference(extension_rule, [i_0_150])). % 0.11/0.40 cnf(i_0_1135, plain, (or(not(X1),X2)!=implies(X1,X2)), inference(closure_rule, [i_0_59])). % 0.11/0.40 cnf(i_0_1133, plain, (implies(or(not(X8),X7),or(not(X1),X2))=implies(or(not(X8),X7),implies(X1,X2))), inference(etableau_closure_rule, [i_0_1133, ...])). % 0.11/0.40 # End printing tableau % 0.11/0.40 # SZS output end % 0.11/0.40 # Branches closed with saturation will be marked with an "s" % 0.11/0.41 # Child (598954) has found a proof. % 0.11/0.41 % 0.11/0.41 # Proof search is over... % 0.11/0.41 # Freeing feature tree %------------------------------------------------------------------------------