0.12/1.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/1.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.16/1.52 Computer : n024.cluster.edu 0.16/1.52 Model : x86_64 x86_64 0.16/1.52 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/1.52 RAMPerCPU : 8042.1875MB 0.16/1.52 OS : Linux 3.10.0-693.el7.x86_64 0.16/1.52 % CPULimit : 960 0.16/1.52 % WCLimit : 120 0.16/1.52 % DateTime : Tue Aug 9 05:05:09 EDT 2022 0.19/1.53 % CPUTime : 0.19/1.62 # No SInE strategy applied 0.19/1.62 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.19/1.62 # and selection function SelectComplexExceptUniqMaxHorn. 0.19/1.62 # 0.19/1.62 # Presaturation interreduction done 0.19/1.62 # Number of axioms: 72 Number of unprocessed: 59 0.19/1.62 # Tableaux proof search. 0.19/1.62 # APR header successfully linked. 0.19/1.62 # Hello from C++ 0.19/1.62 # The folding up rule is enabled... 0.19/1.62 # Local unification is enabled... 0.19/1.62 # Any saturation attempts will use folding labels... 0.19/1.62 # 59 beginning clauses after preprocessing and clausification 0.19/1.62 # Creating start rules for all 1 conjectures. 0.19/1.62 # There are 1 start rule candidates: 0.19/1.62 # Found 17 unit axioms. 0.19/1.62 # 1 start rule tableaux created. 0.19/1.62 # 42 extension rule candidate clauses 0.19/1.62 # 17 unit axiom clauses 0.19/1.62 0.19/1.62 # Requested 8, 32 cores available to the main process. 0.19/1.62 # There are not enough tableaux to fork, creating more from the initial 1 0.19/1.62 # Creating equality axioms 0.19/1.62 # Ran out of tableaux, making start rules for all clauses 0.19/1.62 # Returning from population with 59 new_tableaux and 0 remaining starting tableaux. 0.19/1.62 # We now have 59 tableaux to operate on 2.08/2.01 # There were 1 total branch saturation attempts. 2.08/2.01 # There were 0 of these attempts blocked. 2.08/2.01 # There were 0 deferred branch saturation attempts. 2.08/2.01 # There were 0 free duplicated saturations. 2.08/2.01 # There were 1 total successful branch saturations. 2.08/2.01 # There were 0 successful branch saturations in interreduction. 2.08/2.01 # There were 0 successful branch saturations on the branch. 2.08/2.01 # There were 1 successful branch saturations after the branch. 2.08/2.01 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 2.08/2.01 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 2.08/2.01 # Begin clausification derivation 2.08/2.01 2.08/2.01 # End clausification derivation 2.08/2.01 # Begin listing active clauses obtained from FOF to CNF conversion 2.08/2.01 cnf(i_0_64, plain, (kn2)). 2.08/2.01 cnf(i_0_62, plain, (kn3)). 2.08/2.01 cnf(i_0_66, plain, (substitution_of_equivalents)). 2.08/2.01 cnf(i_0_67, plain, (kn1)). 2.08/2.01 cnf(i_0_61, plain, (modus_ponens)). 2.08/2.01 cnf(i_0_68, plain, (op_implies_and)). 2.08/2.01 cnf(i_0_65, plain, (op_equiv)). 2.08/2.01 cnf(i_0_63, plain, (op_or)). 2.08/2.01 cnf(i_0_44, plain, (is_a_theorem(implies(X1,and(X1,X1))))). 2.08/2.01 cnf(i_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 2.08/2.01 cnf(i_0_14, plain, (is_a_theorem(implies(and(X1,X2),X1)))). 2.08/2.01 cnf(i_0_1, plain, (and_1)). 2.08/2.01 cnf(i_0_59, plain, (implies(not(X1),X2)=or(X1,X2))). 2.08/2.01 cnf(i_0_58, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). 2.08/2.01 cnf(i_0_16, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))))). 2.08/2.01 cnf(i_0_71, negated_conjecture, (~or_1)). 2.08/2.01 cnf(i_0_17, plain, (~is_a_theorem(implies(esk19_0,or(esk19_0,esk20_0))))). 2.08/2.01 cnf(i_0_27, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). 2.08/2.01 cnf(i_0_31, plain, (r2|~is_a_theorem(implies(esk33_0,or(esk32_0,esk33_0))))). 2.08/2.01 cnf(i_0_32, plain, (or_2|~is_a_theorem(implies(esk35_0,or(esk34_0,esk35_0))))). 2.08/2.01 cnf(i_0_53, plain, (implies_1|~is_a_theorem(implies(esk51_0,implies(esk52_0,esk51_0))))). 2.08/2.01 cnf(i_0_6, plain, (and_2|~is_a_theorem(implies(and(esk5_0,esk6_0),esk6_0)))). 2.08/2.01 cnf(i_0_57, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)). 2.08/2.01 cnf(i_0_38, plain, (r1|~is_a_theorem(implies(or(esk40_0,esk40_0),esk40_0)))). 2.08/2.01 cnf(i_0_51, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). 2.08/2.01 cnf(i_0_52, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)). 2.08/2.01 cnf(i_0_23, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk25_0,esk26_0),implies(esk25_0,esk26_0))))). 2.08/2.01 cnf(i_0_40, plain, (r3|~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0))))). 2.08/2.01 cnf(i_0_47, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk47_0,esk48_0),implies(esk48_0,esk47_0))))). 2.08/2.01 cnf(i_0_9, plain, (and_3|~is_a_theorem(implies(esk10_0,implies(esk11_0,and(esk10_0,esk11_0)))))). 2.08/2.01 cnf(i_0_30, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2)). 2.08/2.01 cnf(i_0_33, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2)). 2.08/2.01 cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)). 2.08/2.01 cnf(i_0_39, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)). 2.08/2.01 cnf(i_0_60, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)). 2.08/2.01 cnf(i_0_37, plain, (implies_2|~is_a_theorem(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))))). 2.08/2.01 cnf(i_0_41, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)). 2.08/2.01 cnf(i_0_46, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)). 2.08/2.01 cnf(i_0_24, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)). 2.08/2.01 cnf(i_0_10, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)). 2.08/2.01 cnf(i_0_19, plain, (cn3|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))). 2.08/2.01 cnf(i_0_35, plain, (cn2|~is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))))). 2.08/2.01 cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)). 2.08/2.01 cnf(i_0_20, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)). 2.08/2.01 cnf(i_0_3, plain, (modus_tollens|~is_a_theorem(implies(or(esk4_0,not(esk3_0)),implies(esk3_0,esk4_0))))). 2.08/2.01 cnf(i_0_11, plain, (equivalence_3|~is_a_theorem(implies(implies(esk12_0,esk13_0),implies(implies(esk13_0,esk12_0),equiv(esk12_0,esk13_0)))))). 2.08/2.01 cnf(i_0_22, plain, (cn1|~is_a_theorem(implies(implies(esk22_0,esk23_0),implies(implies(esk23_0,esk24_0),implies(esk22_0,esk24_0)))))). 2.08/2.01 cnf(i_0_29, plain, (r5|~is_a_theorem(implies(implies(esk30_0,esk31_0),implies(or(esk29_0,esk30_0),or(esk29_0,esk31_0)))))). 2.08/2.01 cnf(i_0_55, plain, (implies_3|~is_a_theorem(implies(implies(esk53_0,esk54_0),implies(implies(esk54_0,esk55_0),implies(esk53_0,esk55_0)))))). 2.08/2.01 cnf(i_0_4, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)). 2.08/2.01 cnf(i_0_42, plain, (r4|~is_a_theorem(implies(or(esk43_0,or(esk44_0,esk45_0)),or(esk44_0,or(esk43_0,esk45_0)))))). 2.08/2.01 cnf(i_0_8, plain, (or_3|~is_a_theorem(implies(implies(esk7_0,esk9_0),implies(implies(esk8_0,esk9_0),implies(or(esk7_0,esk8_0),esk9_0)))))). 2.08/2.01 cnf(i_0_36, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)). 2.08/2.01 cnf(i_0_21, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)). 2.08/2.01 cnf(i_0_54, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)). 2.08/2.01 cnf(i_0_12, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)). 2.08/2.01 cnf(i_0_28, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)). 2.08/2.01 cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)). 2.08/2.01 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)). 2.08/2.01 cnf(i_0_159, plain, (X127=X127)). 2.08/2.01 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 2.08/2.01 # Begin printing tableau 2.08/2.01 # Found 6 steps 2.08/2.01 cnf(i_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(start_rule)). 2.08/2.01 cnf(i_0_178, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(extension_rule, [i_0_162])). 2.08/2.01 cnf(i_0_581, plain, (not(and(X1,not(X2)))!=implies(X1,X2)), inference(closure_rule, [i_0_56])). 2.08/2.01 cnf(i_0_579, plain, (not(and(X1,not(X2)))=not(and(X1,not(X2)))), inference(extension_rule, [i_0_163])). 2.08/2.01 cnf(i_0_673, plain, (not(and(X1,not(X2)))!=implies(X1,X2)), inference(closure_rule, [i_0_56])). 2.08/2.01 cnf(i_0_671, plain, (and(not(and(X1,not(X2))),not(and(X1,not(X2))))=and(not(and(X1,not(X2))),implies(X1,X2))), inference(etableau_closure_rule, [i_0_671, ...])). 2.08/2.01 # End printing tableau 2.08/2.01 # SZS output end 2.08/2.01 # Branches closed with saturation will be marked with an "s" 2.08/2.02 # Child (19415) has found a proof. 2.08/2.02 2.08/2.02 # Proof search is over... 2.08/2.02 # Freeing feature tree 2.08/2.03 EOF