%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL509+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 : n031.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:22 PM UTC 2026 % Result : Theorem 2.01s 0.72s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL509+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.10/0.36 % Computer : n031.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Sat Sep 5 21:38:25 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.41 # No SInE strategy applied % 0.10/0.41 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.10/0.41 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.41 # % 0.10/0.41 # Presaturation interreduction done % 0.10/0.41 # Number of axioms: 72 Number of unprocessed: 59 % 0.10/0.41 # Tableaux proof search. % 0.10/0.41 # APR header successfully linked. % 0.10/0.41 # Hello from C++ % 0.10/0.41 # The folding up rule is enabled... % 0.10/0.41 # Local unification is enabled... % 0.10/0.41 # Any saturation attempts will use folding labels... % 0.10/0.41 # 59 beginning clauses after preprocessing and clausification % 0.10/0.41 # Creating start rules for all 1 conjectures. % 0.10/0.41 # There are 1 start rule candidates: % 0.10/0.41 # Found 17 unit axioms. % 0.10/0.41 # 1 start rule tableaux created. % 0.10/0.41 # 42 extension rule candidate clauses % 0.10/0.41 # 17 unit axiom clauses % 0.10/0.41 % 0.10/0.41 # Requested 8, 32 cores available to the main process. % 0.10/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.41 # Creating equality axioms % 0.10/0.41 # Ran out of tableaux, making start rules for all clauses % 0.10/0.41 # Returning from population with 59 new_tableaux and 0 remaining starting tableaux. % 0.10/0.41 # We now have 59 tableaux to operate on % 2.01/0.72 # There were 1 total branch saturation attempts. % 2.01/0.72 # There were 0 of these attempts blocked. % 2.01/0.72 # There were 0 deferred branch saturation attempts. % 2.01/0.72 # There were 0 free duplicated saturations. % 2.01/0.72 # There were 1 total successful branch saturations. % 2.01/0.72 # There were 0 successful branch saturations in interreduction. % 2.01/0.72 # There were 0 successful branch saturations on the branch. % 2.01/0.72 # There were 1 successful branch saturations after the branch. % 2.01/0.72 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.01/0.72 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.01/0.72 # Begin clausification derivation % 2.01/0.72 % 2.01/0.72 # End clausification derivation % 2.01/0.72 # Begin listing active clauses obtained from FOF to CNF conversion % 2.01/0.72 cnf(i_0_64, plain, (modus_ponens)). % 2.01/0.72 cnf(i_0_68, plain, (substitution_of_equivalents)). % 2.01/0.72 cnf(i_0_65, plain, (kn1)). % 2.01/0.72 cnf(i_0_66, plain, (kn2)). % 2.01/0.72 cnf(i_0_67, plain, (kn3)). % 2.01/0.72 cnf(i_0_61, plain, (op_or)). % 2.01/0.72 cnf(i_0_62, plain, (op_implies_and)). % 2.01/0.72 cnf(i_0_63, plain, (op_equiv)). % 2.01/0.72 cnf(i_0_35, plain, (is_a_theorem(implies(X1,and(X1,X1))))). % 2.01/0.72 cnf(i_0_58, plain, (not(and(X1,not(X2)))=implies(X1,X2))). % 2.01/0.72 cnf(i_0_37, plain, (is_a_theorem(implies(and(X1,X2),X1)))). % 2.01/0.72 cnf(i_0_16, plain, (and_1)). % 2.01/0.72 cnf(i_0_56, plain, (implies(not(X1),X2)=or(X1,X2))). % 2.01/0.72 cnf(i_0_60, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). % 2.01/0.72 cnf(i_0_39, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))))). % 2.01/0.72 cnf(i_0_72, negated_conjecture, (~or_1)). % 2.01/0.72 cnf(i_0_22, plain, (~is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0))))). % 2.01/0.72 cnf(i_0_7, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). % 2.01/0.72 cnf(i_0_10, plain, (implies_1|~is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0))))). % 2.01/0.72 cnf(i_0_24, plain, (or_2|~is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))). % 2.01/0.72 cnf(i_0_48, plain, (r2|~is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))))). % 2.01/0.72 cnf(i_0_18, plain, (and_2|~is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0)))). % 2.01/0.72 cnf(i_0_59, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)). % 2.01/0.72 cnf(i_0_11, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)). % 2.01/0.72 cnf(i_0_46, plain, (r1|~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)))). % 2.01/0.72 cnf(i_0_4, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 2.01/0.72 cnf(i_0_28, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))))). % 2.01/0.72 cnf(i_0_30, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk29_0,esk30_0),implies(esk30_0,esk29_0))))). % 2.01/0.72 cnf(i_0_50, plain, (r3|~is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))))). % 2.01/0.72 cnf(i_0_20, plain, (and_3|~is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))))). % 2.01/0.72 cnf(i_0_25, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2)). % 2.01/0.72 cnf(i_0_49, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2)). % 2.01/0.72 cnf(i_0_19, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)). % 2.01/0.72 cnf(i_0_47, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)). % 2.01/0.72 cnf(i_0_57, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)). % 2.01/0.72 cnf(i_0_12, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))). % 2.01/0.72 cnf(i_0_31, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)). % 2.01/0.72 cnf(i_0_29, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)). % 2.01/0.72 cnf(i_0_51, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)). % 2.01/0.72 cnf(i_0_21, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)). % 2.01/0.72 cnf(i_0_42, plain, (cn2|~is_a_theorem(implies(esk42_0,or(esk42_0,esk43_0))))). % 2.01/0.72 cnf(i_0_44, plain, (cn3|~is_a_theorem(implies(or(esk44_0,esk44_0),esk44_0)))). % 2.01/0.72 cnf(i_0_45, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)). % 2.01/0.72 cnf(i_0_43, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)). % 2.01/0.72 cnf(i_0_8, plain, (modus_tollens|~is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0))))). % 2.01/0.72 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)))))). % 2.01/0.72 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)))))). % 2.01/0.72 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)))))). % 2.01/0.72 cnf(i_0_54, plain, (r5|~is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))))). % 2.01/0.72 cnf(i_0_9, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)). % 2.01/0.72 cnf(i_0_52, plain, (r4|~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0)))))). % 2.01/0.72 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)))))). % 2.01/0.72 cnf(i_0_13, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)). % 2.01/0.72 cnf(i_0_15, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)). % 2.01/0.72 cnf(i_0_41, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)). % 2.01/0.72 cnf(i_0_33, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)). % 2.01/0.72 cnf(i_0_55, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)). % 2.01/0.72 cnf(i_0_53, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)). % 2.01/0.72 cnf(i_0_27, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)). % 2.01/0.72 cnf(i_0_159, plain, (X127=X127)). % 2.01/0.72 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.01/0.72 # Begin printing tableau % 2.01/0.72 # Found 6 steps % 2.01/0.72 cnf(i_0_56, plain, (implies(not(X8),X7)=or(X8,X7)), inference(start_rule)). % 2.01/0.72 cnf(i_0_181, plain, (implies(not(X8),X7)=or(X8,X7)), inference(extension_rule, [i_0_162])). % 2.01/0.72 cnf(i_0_581, plain, (implies(not(X8),X7)!=or(X8,X7)), inference(closure_rule, [i_0_56])). % 2.01/0.72 cnf(i_0_579, plain, (implies(not(X8),X7)=implies(not(X8),X7)), inference(extension_rule, [i_0_164])). % 2.01/0.72 cnf(i_0_1454, plain, (not(and(X1,not(X2)))!=implies(X1,X2)), inference(closure_rule, [i_0_58])). % 2.01/0.72 cnf(i_0_1452, plain, (implies(implies(not(X8),X7),not(and(X1,not(X2))))=implies(implies(not(X8),X7),implies(X1,X2))), inference(etableau_closure_rule, [i_0_1452, ...])). % 2.01/0.72 # End printing tableau % 2.01/0.72 # SZS output end % 2.01/0.72 # Branches closed with saturation will be marked with an "s" % 2.01/0.73 # Child (3775382) has found a proof. % 2.01/0.73 % 2.01/0.73 # Proof search is over... % 2.01/0.73 # Freeing feature tree %------------------------------------------------------------------------------