0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.12/0.33 Computer : n023.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 05:29:57 EDT 2022 0.12/0.33 % CPUTime : 0.12/0.36 # No SInE strategy applied 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. 0.12/0.36 # 0.12/0.36 # Presaturation interreduction done 0.12/0.36 # Number of axioms: 74 Number of unprocessed: 60 0.12/0.36 # Tableaux proof search. 0.12/0.36 # APR header successfully linked. 0.12/0.36 # Hello from C++ 0.12/0.37 # The folding up rule is enabled... 0.12/0.37 # Local unification is enabled... 0.12/0.37 # Any saturation attempts will use folding labels... 0.12/0.37 # 60 beginning clauses after preprocessing and clausification 0.12/0.37 # Creating start rules for all 1 conjectures. 0.12/0.37 # There are 1 start rule candidates: 0.12/0.37 # Found 26 unit axioms. 0.12/0.37 # 1 start rule tableaux created. 0.12/0.37 # 34 extension rule candidate clauses 0.12/0.37 # 26 unit axiom clauses 0.12/0.37 0.12/0.37 # Requested 8, 32 cores available to the main process. 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 0.12/0.37 # Creating equality axioms 0.12/0.37 # Ran out of tableaux, making start rules for all clauses 0.12/0.37 # Returning from population with 60 new_tableaux and 0 remaining starting tableaux. 0.12/0.37 # We now have 60 tableaux to operate on 31.69/4.34 # There were 4 total branch saturation attempts. 31.69/4.34 # There were 0 of these attempts blocked. 31.69/4.34 # There were 0 deferred branch saturation attempts. 31.69/4.34 # There were 0 free duplicated saturations. 31.69/4.34 # There were 1 total successful branch saturations. 31.69/4.34 # There were 0 successful branch saturations in interreduction. 31.69/4.34 # There were 0 successful branch saturations on the branch. 31.69/4.34 # There were 1 successful branch saturations after the branch. 31.69/4.34 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 31.69/4.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 31.69/4.34 # Begin clausification derivation 31.69/4.34 31.69/4.34 # End clausification derivation 31.69/4.34 # Begin listing active clauses obtained from FOF to CNF conversion 31.69/4.34 cnf(i_0_67, plain, (substitution_of_equivalents)). 31.69/4.34 cnf(i_0_68, plain, (r5)). 31.69/4.34 cnf(i_0_70, plain, (r2)). 31.69/4.34 cnf(i_0_65, plain, (r1)). 31.69/4.34 cnf(i_0_62, plain, (r3)). 31.69/4.34 cnf(i_0_61, plain, (r4)). 31.69/4.34 cnf(i_0_64, plain, (modus_ponens)). 31.69/4.34 cnf(i_0_74, plain, (op_implies_and)). 31.69/4.34 cnf(i_0_63, plain, (op_implies_or)). 31.69/4.34 cnf(i_0_69, plain, (op_equiv)). 31.69/4.34 cnf(i_0_72, plain, (op_or)). 31.69/4.34 cnf(i_0_66, plain, (op_and)). 31.69/4.34 cnf(i_0_57, plain, (or(not(X1),X2)=implies(X1,X2))). 31.69/4.34 cnf(i_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 31.69/4.34 cnf(i_0_30, plain, (is_a_theorem(implies(X1,or(X2,X1))))). 31.69/4.34 cnf(i_0_32, plain, (or_2)). 31.69/4.34 cnf(i_0_39, plain, (is_a_theorem(implies(or(X1,X1),X1)))). 31.69/4.34 cnf(i_0_60, plain, (not(implies(X1,not(X2)))=and(X1,X2))). 31.69/4.34 cnf(i_0_41, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1))))). 31.69/4.34 cnf(i_0_59, plain, (implies(not(X1),X2)=or(X1,X2))). 31.69/4.34 cnf(i_0_19, plain, (cn3)). 31.69/4.34 cnf(i_0_58, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). 31.69/4.34 cnf(i_0_28, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))))). 31.69/4.34 cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))))). 31.69/4.34 cnf(i_0_73, negated_conjecture, (~implies_2)). 31.69/4.34 cnf(i_0_37, plain, (~is_a_theorem(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))))). 31.69/4.34 cnf(i_0_27, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). 31.69/4.34 cnf(i_0_17, plain, (or_1|~is_a_theorem(implies(esk19_0,or(esk19_0,esk20_0))))). 31.69/4.34 cnf(i_0_45, plain, (kn1|~is_a_theorem(implies(esk46_0,and(esk46_0,esk46_0))))). 31.69/4.34 cnf(i_0_53, plain, (implies_1|~is_a_theorem(implies(esk51_0,implies(esk52_0,esk51_0))))). 31.69/4.34 cnf(i_0_1, plain, (and_1|~is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)))). 31.69/4.34 cnf(i_0_6, plain, (and_2|~is_a_theorem(implies(and(esk5_0,esk6_0),esk6_0)))). 31.69/4.34 cnf(i_0_44, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)). 31.69/4.34 cnf(i_0_13, plain, (kn2|~is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)))). 31.69/4.34 cnf(i_0_51, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). 31.69/4.34 cnf(i_0_52, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)). 31.69/4.34 cnf(i_0_23, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk25_0,esk26_0),implies(esk25_0,esk26_0))))). 31.69/4.34 cnf(i_0_47, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk47_0,esk48_0),implies(esk48_0,esk47_0))))). 31.69/4.34 cnf(i_0_9, plain, (and_3|~is_a_theorem(implies(esk10_0,implies(esk11_0,and(esk10_0,esk11_0)))))). 31.69/4.34 cnf(i_0_18, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~or_1)). 31.69/4.34 cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)). 31.69/4.34 cnf(i_0_2, plain, (is_a_theorem(implies(and(X1,X2),X1))|~and_1)). 31.69/4.34 cnf(i_0_14, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2)). 31.69/4.34 cnf(i_0_46, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)). 31.69/4.34 cnf(i_0_35, plain, (cn2|~is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))))). 31.69/4.34 cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)). 31.69/4.34 cnf(i_0_3, plain, (modus_tollens|~is_a_theorem(implies(or(esk4_0,not(esk3_0)),implies(esk3_0,esk4_0))))). 31.69/4.34 cnf(i_0_24, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)). 31.69/4.34 cnf(i_0_10, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)). 31.69/4.34 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)))))). 31.69/4.34 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)))))). 31.69/4.34 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)))))). 31.69/4.34 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)))))). 31.69/4.34 cnf(i_0_15, plain, (kn3|~is_a_theorem(implies(implies(esk16_0,esk17_0),or(and(esk17_0,esk18_0),not(and(esk18_0,esk16_0))))))). 31.69/4.34 cnf(i_0_4, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)). 31.69/4.34 cnf(i_0_21, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)). 31.69/4.34 cnf(i_0_54, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)). 31.69/4.34 cnf(i_0_12, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)). 31.69/4.34 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)). 31.69/4.34 cnf(i_0_16, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)). 31.69/4.34 cnf(i_0_145, plain, (X127=X127)). 31.69/4.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 31.69/4.34 # Begin printing tableau 31.69/4.34 # Found 10 steps 31.69/4.34 cnf(i_0_39, plain, (is_a_theorem(implies(or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))))), inference(start_rule)). 31.69/4.34 cnf(i_0_171, plain, (is_a_theorem(implies(or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))))), inference(extension_rule, [i_0_51])). 31.69/4.34 cnf(i_0_453, plain, (is_a_theorem(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)))), inference(closure_rule, [i_0_37])). 31.69/4.34 cnf(i_0_455, plain, (~is_a_theorem(or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))))), inference(extension_rule, [i_0_151])). 31.69/4.34 cnf(i_0_536, plain, (or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0)))!=or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)))), inference(extension_rule, [i_0_153])). 31.69/4.34 cnf(i_0_107725, plain, ($false), inference(closure_rule, [i_0_145])). 31.69/4.34 cnf(i_0_107726, plain, (or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0))!=implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0))), inference(closure_rule, [i_0_57])). 31.69/4.34 cnf(i_0_537, plain, (~is_a_theorem(or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0))))), inference(extension_rule, [i_0_51])). 31.69/4.34 cnf(i_0_158135, plain, (~is_a_theorem(implies(or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0)),or(implies(implies(esk38_0,implies(esk38_0,esk39_0)),implies(esk38_0,esk39_0)),or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0)))))), inference(closure_rule, [i_0_30])). 31.69/4.34 cnf(i_0_158136, plain, (~is_a_theorem(or(not(implies(esk38_0,implies(esk38_0,esk39_0))),implies(esk38_0,esk39_0)))), inference(etableau_closure_rule, [i_0_158136, ...])). 31.69/4.34 # End printing tableau 31.69/4.34 # SZS output end 31.69/4.34 # Branches closed with saturation will be marked with an "s" 31.69/4.35 # Child (30328) has found a proof. 31.69/4.35 31.69/4.35 # Proof search is over... 31.69/4.35 # Freeing feature tree 31.69/4.36 EOF