0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.14/0.35 % Computer : n011.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 1200 0.14/0.35 % WCLimit : 120 0.14/0.35 % DateTime : Tue Jul 13 16:12:55 EDT 2021 0.21/0.35 % CPUTime : 0.21/0.38 # No SInE strategy applied 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn. 0.21/0.38 # 0.21/0.38 # Presaturation interreduction done 0.21/0.38 # Number of axioms: 72 Number of unprocessed: 61 0.21/0.38 # Tableaux proof search. 0.21/0.38 # APR header successfully linked. 0.21/0.38 # Hello from C++ 0.21/0.39 # The folding up rule is enabled... 0.21/0.39 # Local unification is enabled... 0.21/0.39 # Any saturation attempts will use folding labels... 0.21/0.39 # 61 beginning clauses after preprocessing and clausification 0.21/0.39 # Creating start rules for all 1 conjectures. 0.21/0.39 # There are 1 start rule candidates: 0.21/0.39 # Found 21 unit axioms. 0.21/0.39 # 1 start rule tableaux created. 0.21/0.39 # 40 extension rule candidate clauses 0.21/0.39 # 21 unit axiom clauses 0.21/0.39 0.21/0.39 # Requested 8, 32 cores available to the main process. 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 1 0.21/0.39 # Creating equality axioms 0.21/0.39 # Ran out of tableaux, making start rules for all clauses 0.21/0.39 # Returning from population with 61 new_tableaux and 0 remaining starting tableaux. 0.21/0.39 # We now have 61 tableaux to operate on 223.10/31.91 # There were 12 total branch saturation attempts. 223.10/31.91 # There were 0 of these attempts blocked. 223.10/31.91 # There were 0 deferred branch saturation attempts. 223.10/31.91 # There were 0 free duplicated saturations. 223.10/31.91 # There were 1 total successful branch saturations. 223.10/31.91 # There were 0 successful branch saturations in interreduction. 223.10/31.91 # There were 0 successful branch saturations on the branch. 223.10/31.91 # There were 1 successful branch saturations after the branch. 223.10/31.91 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 223.10/31.91 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 223.10/31.91 # Begin clausification derivation 223.10/31.91 223.10/31.91 # End clausification derivation 223.10/31.91 # Begin listing active clauses obtained from FOF to CNF conversion 223.10/31.91 cnf(i_0_63, plain, (modus_ponens)). 223.10/31.91 cnf(i_0_67, plain, (kn3)). 223.10/31.91 cnf(i_0_65, plain, (kn1)). 223.10/31.91 cnf(i_0_66, plain, (kn2)). 223.10/31.91 cnf(i_0_61, plain, (substitution_of_equivalents)). 223.10/31.91 cnf(i_0_72, plain, (op_implies_or)). 223.10/31.91 cnf(i_0_62, plain, (op_implies_and)). 223.10/31.91 cnf(i_0_64, plain, (op_or)). 223.10/31.91 cnf(i_0_68, plain, (op_equiv)). 223.10/31.91 cnf(i_0_69, plain, (op_and)). 223.10/31.91 cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2))). 223.10/31.91 cnf(i_0_57, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 223.10/31.91 cnf(i_0_32, plain, (is_a_theorem(implies(X1,and(X1,X1))))). 223.10/31.91 cnf(i_0_58, plain, (implies(not(X1),X2)=or(X1,X2))). 223.10/31.91 cnf(i_0_41, plain, (is_a_theorem(implies(and(X1,X2),X1)))). 223.10/31.91 cnf(i_0_6, plain, (and_1)). 223.10/31.91 cnf(i_0_60, plain, (not(implies(X1,not(X2)))=and(X1,X2))). 223.10/31.91 cnf(i_0_59, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). 223.10/31.91 cnf(i_0_30, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))))). 223.10/31.91 cnf(i_0_71, negated_conjecture, (~r3)). 223.10/31.91 cnf(i_0_25, plain, (~is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))). 223.10/31.91 cnf(i_0_53, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). 223.10/31.91 cnf(i_0_33, plain, (or_2|~is_a_theorem(implies(esk33_0,or(esk32_0,esk33_0))))). 223.10/31.91 cnf(i_0_35, plain, (or_1|~is_a_theorem(implies(esk34_0,or(esk34_0,esk35_0))))). 223.10/31.91 cnf(i_0_47, plain, (implies_1|~is_a_theorem(implies(esk49_0,implies(esk50_0,esk49_0))))). 223.10/31.91 cnf(i_0_49, plain, (r2|~is_a_theorem(implies(esk52_0,or(esk51_0,esk52_0))))). 223.10/31.91 cnf(i_0_22, plain, (r1|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))). 223.10/31.91 cnf(i_0_48, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)). 223.10/31.91 cnf(i_0_23, plain, (and_2|~is_a_theorem(implies(and(esk22_0,esk23_0),esk23_0)))). 223.10/31.91 cnf(i_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). 223.10/31.91 cnf(i_0_16, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))))). 223.10/31.91 cnf(i_0_19, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk19_0,esk20_0),implies(esk19_0,esk20_0))))). 223.10/31.91 cnf(i_0_27, plain, (and_3|~is_a_theorem(implies(esk26_0,implies(esk27_0,and(esk26_0,esk27_0)))))). 223.10/31.91 cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2)). 223.10/31.91 cnf(i_0_50, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2)). 223.10/31.91 cnf(i_0_36, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~or_1)). 223.10/31.91 cnf(i_0_24, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)). 223.10/31.91 cnf(i_0_14, plain, (cn2|~is_a_theorem(implies(esk13_0,or(esk13_0,esk14_0))))). 223.10/31.91 cnf(i_0_51, plain, (cn3|~is_a_theorem(implies(or(esk53_0,esk53_0),esk53_0)))). 223.10/31.91 cnf(i_0_21, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)). 223.10/31.91 cnf(i_0_13, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)). 223.10/31.91 cnf(i_0_44, plain, (modus_tollens|~is_a_theorem(implies(or(esk45_0,not(esk44_0)),implies(esk44_0,esk45_0))))). 223.10/31.91 cnf(i_0_8, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))). 223.10/31.91 cnf(i_0_52, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)). 223.10/31.91 cnf(i_0_15, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)). 223.10/31.91 cnf(i_0_20, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)). 223.10/31.91 cnf(i_0_28, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)). 223.10/31.91 cnf(i_0_1, plain, (implies_3|~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))). 223.10/31.91 cnf(i_0_4, plain, (cn1|~is_a_theorem(implies(implies(esk4_0,esk5_0),implies(implies(esk5_0,esk6_0),implies(esk4_0,esk6_0)))))). 223.10/31.91 cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)). 223.10/31.91 cnf(i_0_17, plain, (equivalence_3|~is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))))). 223.10/31.91 cnf(i_0_38, plain, (r5|~is_a_theorem(implies(implies(esk37_0,esk38_0),implies(or(esk36_0,esk37_0),or(esk36_0,esk38_0)))))). 223.10/31.91 cnf(i_0_39, plain, (r4|~is_a_theorem(implies(or(esk39_0,or(esk40_0,esk41_0)),or(esk40_0,or(esk39_0,esk41_0)))))). 223.10/31.91 cnf(i_0_46, plain, (or_3|~is_a_theorem(implies(implies(esk46_0,esk48_0),implies(implies(esk47_0,esk48_0),implies(or(esk46_0,esk47_0),esk48_0)))))). 223.10/31.91 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)). 223.10/31.91 cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)). 223.10/31.91 cnf(i_0_3, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)). 223.10/31.91 cnf(i_0_18, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)). 223.10/31.91 cnf(i_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)). 223.10/31.91 cnf(i_0_40, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)). 223.10/31.91 cnf(i_0_45, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)). 223.10/31.91 cnf(i_0_155, plain, (X127=X127)). 223.10/31.91 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 223.10/31.91 # Begin printing tableau 223.10/31.91 # Found 5 steps 223.10/31.91 cnf(i_0_60, plain, (not(implies(X1,not(X2)))=and(X1,X2)), inference(start_rule)). 223.10/31.91 cnf(i_0_181, plain, (not(implies(X1,not(X2)))=and(X1,X2)), inference(extension_rule, [i_0_158])). 223.10/31.91 cnf(i_0_565, plain, (not(implies(X1,not(X2)))!=and(X1,X2)), inference(closure_rule, [i_0_60])). 223.10/31.91 cnf(i_0_563, plain, (not(implies(X1,not(X2)))=not(implies(X1,not(X2)))), inference(extension_rule, [i_0_162])). 223.10/31.91 cnf(i_0_1374682, plain, (not(not(implies(X1,not(X2))))=not(not(implies(X1,not(X2))))), inference(etableau_closure_rule, [i_0_1374682, ...])). 223.10/31.91 # End printing tableau 223.10/31.91 # SZS output end 223.10/31.91 # Branches closed with saturation will be marked with an "s" 223.10/31.92 # Child (16693) has found a proof. 223.10/31.92 223.10/31.92 # Proof search is over... 223.10/31.92 # Freeing feature tree 223.10/31.95 EOF