0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.35 Computer : n021.cluster.edu 0.13/0.35 Model : x86_64 x86_64 0.13/0.35 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 RAMPerCPU : 8042.1875MB 0.13/0.35 OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Aug 9 02:09:05 EDT 2022 0.13/0.35 % CPUTime : 0.13/0.39 # No SInE strategy applied 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. 0.13/0.39 # 0.13/0.39 # Presaturation interreduction done 0.13/0.39 # Number of axioms: 82 Number of unprocessed: 58 0.13/0.39 # Tableaux proof search. 0.13/0.39 # APR header successfully linked. 0.13/0.39 # Hello from C++ 0.13/0.39 # The folding up rule is enabled... 0.13/0.39 # Local unification is enabled... 0.13/0.39 # Any saturation attempts will use folding labels... 0.13/0.39 # 58 beginning clauses after preprocessing and clausification 0.13/0.39 # Creating start rules for all 1 conjectures. 0.13/0.39 # There are 1 start rule candidates: 0.13/0.39 # Found 44 unit axioms. 0.13/0.39 # 1 start rule tableaux created. 0.13/0.39 # 14 extension rule candidate clauses 0.13/0.39 # 44 unit axiom clauses 0.13/0.39 0.13/0.39 # Requested 8, 32 cores available to the main process. 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 1 0.13/0.39 # Creating equality axioms 0.13/0.39 # Ran out of tableaux, making start rules for all clauses 0.13/0.39 # Returning from population with 58 new_tableaux and 0 remaining starting tableaux. 0.13/0.39 # We now have 58 tableaux to operate on 0.20/0.50 # There were 2 total branch saturation attempts. 0.20/0.50 # There were 0 of these attempts blocked. 0.20/0.50 # There were 0 deferred branch saturation attempts. 0.20/0.50 # There were 0 free duplicated saturations. 0.20/0.50 # There were 2 total successful branch saturations. 0.20/0.50 # There were 0 successful branch saturations in interreduction. 0.20/0.50 # There were 0 successful branch saturations on the branch. 0.20/0.50 # There were 2 successful branch saturations after the branch. 0.20/0.50 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.50 # Begin clausification derivation 0.20/0.50 0.20/0.50 # End clausification derivation 0.20/0.50 # Begin listing active clauses obtained from FOF to CNF conversion 0.20/0.50 cnf(i_0_75, plain, (and_1)). 0.20/0.50 cnf(i_0_74, plain, (modus_tollens)). 0.20/0.50 cnf(i_0_61, plain, (and_2)). 0.20/0.50 cnf(i_0_64, plain, (or_3)). 0.20/0.50 cnf(i_0_69, plain, (and_3)). 0.20/0.50 cnf(i_0_66, plain, (equivalence_3)). 0.20/0.50 cnf(i_0_65, plain, (or_1)). 0.20/0.50 cnf(i_0_73, plain, (equivalence_1)). 0.20/0.50 cnf(i_0_78, plain, (substitution_of_equivalents)). 0.20/0.50 cnf(i_0_71, plain, (or_2)). 0.20/0.50 cnf(i_0_62, plain, (implies_2)). 0.20/0.50 cnf(i_0_72, plain, (equivalence_2)). 0.20/0.50 cnf(i_0_70, plain, (modus_ponens)). 0.20/0.50 cnf(i_0_77, plain, (implies_1)). 0.20/0.50 cnf(i_0_63, plain, (implies_3)). 0.20/0.50 cnf(i_0_68, plain, (op_implies_and)). 0.20/0.50 cnf(i_0_80, plain, (op_implies_or)). 0.20/0.50 cnf(i_0_76, plain, (op_equiv)). 0.20/0.50 cnf(i_0_67, plain, (op_or)). 0.20/0.50 cnf(i_0_81, plain, (op_and)). 0.20/0.50 cnf(i_0_57, plain, (or(not(X1),X2)=implies(X1,X2))). 0.20/0.50 cnf(i_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 0.20/0.50 cnf(i_0_52, plain, (is_a_theorem(implies(X1,implies(X2,X1))))). 0.20/0.50 cnf(i_0_60, plain, (not(implies(X1,not(X2)))=and(X1,X2))). 0.20/0.50 cnf(i_0_33, plain, (is_a_theorem(implies(X1,or(X2,X1))))). 0.20/0.50 cnf(i_0_18, plain, (is_a_theorem(implies(X1,or(X1,X2))))). 0.20/0.50 cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X2)))). 0.20/0.50 cnf(i_0_2, plain, (is_a_theorem(implies(and(X1,X2),X1)))). 0.20/0.50 cnf(i_0_31, plain, (r2)). 0.20/0.50 cnf(i_0_13, plain, (kn2)). 0.20/0.50 cnf(i_0_59, plain, (implies(not(X1),X2)=or(X1,X2))). 0.20/0.50 cnf(i_0_35, plain, (cn2)). 0.20/0.50 cnf(i_0_46, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))). 0.20/0.50 cnf(i_0_24, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))). 0.20/0.50 cnf(i_0_10, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))). 0.20/0.50 cnf(i_0_58, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). 0.20/0.50 cnf(i_0_4, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))))). 0.20/0.50 cnf(i_0_36, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))). 0.20/0.50 cnf(i_0_54, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))). 0.20/0.50 cnf(i_0_22, plain, (cn1)). 0.20/0.50 cnf(i_0_12, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))). 0.20/0.50 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2)))))). 0.20/0.50 cnf(i_0_82, negated_conjecture, (~r3)). 0.20/0.50 cnf(i_0_40, plain, (~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0))))). 0.20/0.50 cnf(i_0_27, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). 0.20/0.50 cnf(i_0_45, plain, (kn1|~is_a_theorem(implies(esk46_0,and(esk46_0,esk46_0))))). 0.20/0.50 cnf(i_0_44, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)). 0.20/0.50 cnf(i_0_38, plain, (r1|~is_a_theorem(implies(or(esk40_0,esk40_0),esk40_0)))). 0.20/0.50 cnf(i_0_51, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). 0.20/0.50 cnf(i_0_39, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)). 0.20/0.50 cnf(i_0_19, plain, (cn3|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))). 0.20/0.50 cnf(i_0_20, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)). 0.20/0.50 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)))))). 0.20/0.50 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)))))). 0.20/0.50 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))))))). 0.20/0.50 cnf(i_0_28, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)). 0.20/0.50 cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)). 0.20/0.50 cnf(i_0_16, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)). 0.20/0.50 cnf(i_0_113, plain, (X127=X127)). 0.20/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.20/0.50 # Begin printing tableau 0.20/0.50 # Found 6 steps 0.20/0.50 cnf(i_0_45, plain, (kn1|~is_a_theorem(implies(esk46_0,and(esk46_0,esk46_0)))), inference(start_rule)). 0.20/0.50 cnf(i_0_169, plain, (kn1), inference(extension_rule, [i_0_44])). 0.20/0.50 cnf(i_0_360, plain, (is_a_theorem(implies(implies(X1,implies(X2,X1)),and(implies(X1,implies(X2,X1)),implies(X1,implies(X2,X1)))))), inference(extension_rule, [i_0_51])). 0.20/0.50 cnf(i_0_370, plain, (~is_a_theorem(implies(X1,implies(X2,X1)))), inference(closure_rule, [i_0_52])). 0.20/0.50 cnf(i_0_170, plain, (~is_a_theorem(implies(esk46_0,and(esk46_0,esk46_0)))), inference(etableau_closure_rule, [i_0_170, ...])). 0.20/0.50 cnf(i_0_368, plain, (is_a_theorem(and(implies(X1,implies(X2,X1)),implies(X1,implies(X2,X1))))), inference(etableau_closure_rule, [i_0_368, ...])). 0.20/0.50 # End printing tableau 0.20/0.50 # SZS output end 0.20/0.50 # Branches closed with saturation will be marked with an "s" 0.20/0.50 # Child (17535) has found a proof. 0.20/0.50 0.20/0.50 # Proof search is over... 0.20/0.50 # Freeing feature tree 0.20/0.50 EOF