0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.30 Computer : n011.cluster.edu 0.10/0.30 Model : x86_64 x86_64 0.10/0.30 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.30 RAMPerCPU : 8042.1875MB 0.10/0.30 OS : Linux 3.10.0-693.el7.x86_64 0.10/0.30 % CPULimit : 960 0.10/0.30 % WCLimit : 120 0.10/0.30 % DateTime : Tue Aug 9 05:20:21 EDT 2022 0.10/0.30 % CPUTime : 0.16/0.34 # No SInE strategy applied 0.16/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.16/0.34 # and selection function SelectComplexExceptUniqMaxHorn. 0.16/0.34 # 0.16/0.34 # Presaturation interreduction done 0.16/0.34 # Number of axioms: 147 Number of unprocessed: 115 0.16/0.34 # Tableaux proof search. 0.16/0.34 # APR header successfully linked. 0.16/0.34 # Hello from C++ 0.16/0.35 # The folding up rule is enabled... 0.16/0.35 # Local unification is enabled... 0.16/0.35 # Any saturation attempts will use folding labels... 0.16/0.35 # 115 beginning clauses after preprocessing and clausification 0.16/0.35 # Creating start rules for all 1 conjectures. 0.16/0.35 # There are 1 start rule candidates: 0.16/0.35 # Found 56 unit axioms. 0.16/0.35 # 1 start rule tableaux created. 0.16/0.35 # 59 extension rule candidate clauses 0.16/0.35 # 56 unit axiom clauses 0.16/0.35 0.16/0.35 # Requested 8, 32 cores available to the main process. 0.16/0.35 # There are not enough tableaux to fork, creating more from the initial 1 0.16/0.35 # Creating equality axioms 0.16/0.35 # Ran out of tableaux, making start rules for all clauses 0.16/0.35 # Returning from population with 115 new_tableaux and 0 remaining starting tableaux. 0.16/0.35 # We now have 115 tableaux to operate on 10.66/1.75 # There were 2 total branch saturation attempts. 10.66/1.75 # There were 0 of these attempts blocked. 10.66/1.75 # There were 0 deferred branch saturation attempts. 10.66/1.75 # There were 0 free duplicated saturations. 10.66/1.75 # There were 2 total successful branch saturations. 10.66/1.75 # There were 0 successful branch saturations in interreduction. 10.66/1.75 # There were 0 successful branch saturations on the branch. 10.66/1.75 # There were 2 successful branch saturations after the branch. 10.66/1.75 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 10.66/1.75 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 10.66/1.75 # Begin clausification derivation 10.66/1.75 10.66/1.75 # End clausification derivation 10.66/1.75 # Begin listing active clauses obtained from FOF to CNF conversion 10.66/1.75 cnf(i_0_75, plain, (and_1)). 10.66/1.75 cnf(i_0_74, plain, (modus_tollens)). 10.66/1.75 cnf(i_0_61, plain, (and_2)). 10.66/1.75 cnf(i_0_64, plain, (or_3)). 10.66/1.75 cnf(i_0_69, plain, (and_3)). 10.66/1.75 cnf(i_0_66, plain, (equivalence_3)). 10.66/1.75 cnf(i_0_65, plain, (or_1)). 10.66/1.75 cnf(i_0_73, plain, (equivalence_1)). 10.66/1.75 cnf(i_0_78, plain, (substitution_of_equivalents)). 10.66/1.75 cnf(i_0_71, plain, (or_2)). 10.66/1.75 cnf(i_0_62, plain, (implies_2)). 10.66/1.75 cnf(i_0_72, plain, (equivalence_2)). 10.66/1.75 cnf(i_0_70, plain, (modus_ponens)). 10.66/1.75 cnf(i_0_77, plain, (implies_1)). 10.66/1.75 cnf(i_0_63, plain, (implies_3)). 10.66/1.75 cnf(i_0_68, plain, (op_implies_and)). 10.66/1.75 cnf(i_0_76, plain, (op_equiv)). 10.66/1.75 cnf(i_0_67, plain, (op_or)). 10.66/1.75 cnf(i_0_135, plain, (axiom_B)). 10.66/1.75 cnf(i_0_140, plain, (axiom_K)). 10.66/1.75 cnf(i_0_136, plain, (axiom_4)). 10.66/1.75 cnf(i_0_139, plain, (necessitation)). 10.66/1.75 cnf(i_0_138, plain, (axiom_M)). 10.66/1.75 cnf(i_0_137, plain, (op_possibly)). 10.66/1.75 cnf(i_0_144, plain, (op_strict_equiv)). 10.66/1.75 cnf(i_0_146, plain, (op_strict_implies)). 10.66/1.75 cnf(i_0_145, plain, (op_implies)). 10.66/1.75 cnf(i_0_131, plain, (not(necessarily(not(X1)))=possibly(X1))). 10.66/1.75 cnf(i_0_122, plain, (is_a_theorem(implies(necessarily(X1),X1)))). 10.66/1.75 cnf(i_0_134, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2))). 10.66/1.75 cnf(i_0_81, plain, (is_a_theorem(implies(X1,necessarily(possibly(X1)))))). 10.66/1.75 cnf(i_0_52, plain, (is_a_theorem(implies(X1,implies(X2,X1))))). 10.66/1.75 cnf(i_0_33, plain, (is_a_theorem(implies(X1,or(X2,X1))))). 10.66/1.75 cnf(i_0_31, plain, (r2)). 10.66/1.75 cnf(i_0_18, plain, (is_a_theorem(implies(X1,or(X1,X2))))). 10.66/1.75 cnf(i_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 10.66/1.75 cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X2)))). 10.66/1.75 cnf(i_0_2, plain, (is_a_theorem(implies(and(X1,X2),X1)))). 10.66/1.75 cnf(i_0_13, plain, (kn2)). 10.66/1.75 cnf(i_0_95, plain, (is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1)))))). 10.66/1.75 cnf(i_0_59, plain, (implies(not(X1),X2)=or(X1,X2))). 10.66/1.75 cnf(i_0_35, plain, (cn2)). 10.66/1.75 cnf(i_0_46, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))). 10.66/1.75 cnf(i_0_24, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))). 10.66/1.75 cnf(i_0_10, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))). 10.66/1.75 cnf(i_0_132, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2))). 10.66/1.75 cnf(i_0_4, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))))). 10.66/1.75 cnf(i_0_36, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))). 10.66/1.75 cnf(i_0_92, plain, (is_a_theorem(implies(strict_implies(X1,X2),implies(necessarily(X1),necessarily(X2)))))). 10.66/1.75 cnf(i_0_54, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))). 10.66/1.75 cnf(i_0_22, plain, (cn1)). 10.66/1.75 cnf(i_0_12, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))). 10.66/1.75 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2)))))). 10.66/1.75 cnf(i_0_58, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1)))). 10.66/1.75 cnf(i_0_141, negated_conjecture, (~axiom_m10)). 10.66/1.75 cnf(i_0_129, plain, (~is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0)))))). 10.66/1.75 cnf(i_0_89, plain, (substitution_strict_equiv|esk66_0!=esk65_0)). 10.66/1.75 cnf(i_0_114, plain, (modus_ponens_strict_implies|~is_a_theorem(esk84_0))). 10.66/1.75 cnf(i_0_115, plain, (modus_ponens_strict_implies|is_a_theorem(esk83_0))). 10.66/1.75 cnf(i_0_127, plain, (adjunction|is_a_theorem(esk92_0))). 10.66/1.75 cnf(i_0_126, plain, (adjunction|is_a_theorem(esk93_0))). 10.66/1.75 cnf(i_0_125, plain, (adjunction|~is_a_theorem(and(esk92_0,esk93_0)))). 10.66/1.75 cnf(i_0_101, plain, (axiom_m6|~is_a_theorem(strict_implies(esk72_0,possibly(esk72_0))))). 10.66/1.75 cnf(i_0_106, plain, (is_a_theorem(necessarily(X1))|~is_a_theorem(X1))). 10.66/1.75 cnf(i_0_90, plain, (substitution_strict_equiv|is_a_theorem(strict_equiv(esk65_0,esk66_0)))). 10.66/1.75 cnf(i_0_27, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))). 10.66/1.75 cnf(i_0_91, plain, (X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2)))). 10.66/1.75 cnf(i_0_116, plain, (modus_ponens_strict_implies|is_a_theorem(strict_implies(esk83_0,esk84_0)))). 10.66/1.75 cnf(i_0_45, plain, (kn1|~is_a_theorem(implies(esk46_0,and(esk46_0,esk46_0))))). 10.66/1.75 cnf(i_0_83, plain, (axiom_m4|~is_a_theorem(strict_implies(esk59_0,and(esk59_0,esk59_0))))). 10.66/1.75 cnf(i_0_133, plain, (not(possibly(not(X1)))=necessarily(X1)|~op_necessarily)). 10.66/1.75 cnf(i_0_38, plain, (r1|~is_a_theorem(implies(or(esk40_0,esk40_0),esk40_0)))). 10.66/1.75 cnf(i_0_103, plain, (axiom_m2|~is_a_theorem(strict_implies(and(esk73_0,esk74_0),esk73_0)))). 10.66/1.75 cnf(i_0_100, plain, (is_a_theorem(strict_implies(X1,possibly(X1)))|~axiom_m6)). 10.66/1.75 cnf(i_0_96, plain, (axiom_5|~is_a_theorem(implies(possibly(esk70_0),necessarily(possibly(esk70_0)))))). 10.66/1.75 cnf(i_0_98, plain, (axiom_s4|~is_a_theorem(strict_implies(necessarily(esk71_0),necessarily(necessarily(esk71_0)))))). 10.66/1.75 cnf(i_0_57, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)). 10.66/1.75 cnf(i_0_51, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). 10.66/1.75 cnf(i_0_113, plain, (is_a_theorem(X1)|~modus_ponens_strict_implies|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2))). 10.66/1.75 cnf(i_0_119, plain, (axiom_m9|~is_a_theorem(strict_implies(possibly(possibly(esk87_0)),possibly(esk87_0))))). 10.66/1.75 cnf(i_0_79, plain, (axiom_m7|~is_a_theorem(strict_implies(possibly(and(esk56_0,esk57_0)),esk56_0)))). 10.66/1.75 cnf(i_0_40, plain, (r3|~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0))))). 10.66/1.75 cnf(i_0_128, plain, (is_a_theorem(and(X1,X2))|~adjunction|~is_a_theorem(X2)|~is_a_theorem(X1))). 10.66/1.75 cnf(i_0_44, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)). 10.66/1.75 cnf(i_0_88, plain, (axiom_m1|~is_a_theorem(strict_implies(and(esk63_0,esk64_0),and(esk64_0,esk63_0))))). 10.66/1.75 cnf(i_0_84, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4)). 10.66/1.75 cnf(i_0_39, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)). 10.66/1.75 cnf(i_0_102, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2)). 10.66/1.75 cnf(i_0_97, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|~axiom_5)). 10.66/1.75 cnf(i_0_99, plain, (is_a_theorem(strict_implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_s4)). 10.66/1.75 cnf(i_0_60, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)). 10.66/1.75 cnf(i_0_120, plain, (is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1)))|~axiom_m9)). 10.66/1.75 cnf(i_0_109, plain, (axiom_m8|~is_a_theorem(strict_implies(strict_implies(esk78_0,esk79_0),strict_implies(possibly(esk78_0),possibly(esk79_0)))))). 10.66/1.75 cnf(i_0_80, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),X1))|~axiom_m7)). 10.66/1.75 cnf(i_0_117, plain, (axiom_s2|~is_a_theorem(strict_implies(possibly(and(esk85_0,esk86_0)),and(possibly(esk85_0),possibly(esk86_0)))))). 10.66/1.75 cnf(i_0_20, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)). 10.66/1.75 cnf(i_0_41, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)). 10.66/1.75 cnf(i_0_87, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1)). 10.66/1.75 cnf(i_0_19, plain, (cn3|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))). 10.66/1.75 cnf(i_0_105, plain, (axiom_s3|~is_a_theorem(strict_implies(strict_implies(esk75_0,esk76_0),strict_implies(not(possibly(esk76_0)),not(possibly(esk75_0))))))). 10.66/1.75 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)))))). 10.66/1.75 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)))))). 10.66/1.75 cnf(i_0_85, plain, (axiom_m3|~is_a_theorem(strict_implies(and(and(esk60_0,esk61_0),esk62_0),and(esk60_0,and(esk61_0,esk62_0)))))). 10.66/1.75 cnf(i_0_110, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(possibly(X1),possibly(X2))))|~axiom_m8)). 10.66/1.75 cnf(i_0_111, plain, (axiom_m5|~is_a_theorem(strict_implies(and(strict_implies(esk80_0,esk81_0),strict_implies(esk81_0,esk82_0)),strict_implies(esk80_0,esk82_0))))). 10.66/1.75 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))))))). 10.66/1.75 cnf(i_0_123, plain, (axiom_s1|~is_a_theorem(implies(and(strict_implies(esk89_0,esk90_0),strict_implies(esk90_0,esk91_0)),strict_implies(esk89_0,esk91_0))))). 10.66/1.75 cnf(i_0_118, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),and(possibly(X1),possibly(X2))))|~axiom_s2)). 10.66/1.75 cnf(i_0_104, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(not(possibly(X2)),not(possibly(X1)))))|~axiom_s3)). 10.66/1.75 cnf(i_0_28, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)). 10.66/1.75 cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)). 10.66/1.75 cnf(i_0_86, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))|~axiom_m3)). 10.66/1.75 cnf(i_0_112, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_m5)). 10.66/1.75 cnf(i_0_16, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)). 10.66/1.75 cnf(i_0_124, plain, (is_a_theorem(implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_s1)). 10.66/1.75 cnf(i_0_273, plain, (X211=X211)). 10.66/1.75 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 10.66/1.75 # Begin printing tableau 10.66/1.75 # Found 5 steps 10.66/1.75 cnf(i_0_123, plain, (axiom_s1|~is_a_theorem(implies(and(strict_implies(esk89_0,esk90_0),strict_implies(esk90_0,esk91_0)),strict_implies(esk89_0,esk91_0)))), inference(start_rule)). 10.66/1.75 cnf(i_0_449, plain, (axiom_s1), inference(extension_rule, [i_0_124])). 10.66/1.75 cnf(i_0_1064, plain, (is_a_theorem(implies(and(strict_implies(X8,X7),strict_implies(X7,X3)),strict_implies(X8,X3)))), inference(extension_rule, [i_0_106])). 10.66/1.75 cnf(i_0_450, plain, (~is_a_theorem(implies(and(strict_implies(esk89_0,esk90_0),strict_implies(esk90_0,esk91_0)),strict_implies(esk89_0,esk91_0)))), inference(etableau_closure_rule, [i_0_450, ...])). 10.66/1.75 cnf(i_0_1080, plain, (is_a_theorem(necessarily(implies(and(strict_implies(X8,X7),strict_implies(X7,X3)),strict_implies(X8,X3))))), inference(etableau_closure_rule, [i_0_1080, ...])). 10.66/1.75 # End printing tableau 10.66/1.75 # SZS output end 10.66/1.75 # Branches closed with saturation will be marked with an "s" 10.66/1.76 # Child (26612) has found a proof. 10.66/1.76 10.66/1.76 # Proof search is over... 10.66/1.76 # Freeing feature tree 10.66/1.77 EOF