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 : n022.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 06:26:31 EDT 2022 0.13/0.35 % CPUTime : 0.13/0.38 # No SInE strategy applied 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. 0.13/0.38 # 0.13/0.38 # Presaturation interreduction done 0.13/0.38 # Number of axioms: 84 Number of unprocessed: 65 0.13/0.38 # Tableaux proof search. 0.13/0.38 # APR header successfully linked. 0.13/0.38 # 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 # 65 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 36 unit axioms. 0.13/0.39 # 1 start rule tableaux created. 0.13/0.39 # 29 extension rule candidate clauses 0.13/0.39 # 36 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 65 new_tableaux and 0 remaining starting tableaux. 0.13/0.39 # We now have 65 tableaux to operate on 14.71/2.22 # There were 2 total branch saturation attempts. 14.71/2.22 # There were 0 of these attempts blocked. 14.71/2.22 # There were 0 deferred branch saturation attempts. 14.71/2.22 # There were 0 free duplicated saturations. 14.71/2.22 # There were 2 total successful branch saturations. 14.71/2.22 # There were 0 successful branch saturations in interreduction. 14.71/2.22 # There were 0 successful branch saturations on the branch. 14.71/2.22 # There were 2 successful branch saturations after the branch. 14.71/2.22 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 14.71/2.22 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 14.71/2.22 # Begin clausification derivation 14.71/2.22 14.71/2.22 # End clausification derivation 14.71/2.22 # Begin listing active clauses obtained from FOF to CNF conversion 14.71/2.22 cnf(i_0_84, plain, (op_implies_and)). 14.71/2.22 cnf(i_0_68, plain, (op_equiv)). 14.71/2.22 cnf(i_0_73, plain, (op_or)). 14.71/2.22 cnf(i_0_71, plain, (axiom_m4)). 14.71/2.22 cnf(i_0_66, plain, (axiom_m3)). 14.71/2.22 cnf(i_0_65, plain, (axiom_m1)). 14.71/2.22 cnf(i_0_64, plain, (substitution_strict_equiv)). 14.71/2.22 cnf(i_0_78, plain, (axiom_m6)). 14.71/2.22 cnf(i_0_72, plain, (axiom_m2)). 14.71/2.22 cnf(i_0_79, plain, (axiom_s3)). 14.71/2.22 cnf(i_0_70, plain, (axiom_m5)). 14.71/2.22 cnf(i_0_75, plain, (modus_ponens_strict_implies)). 14.71/2.22 cnf(i_0_77, plain, (axiom_m9)). 14.71/2.22 cnf(i_0_63, plain, (adjunction)). 14.71/2.22 cnf(i_0_62, plain, (op_possibly)). 14.71/2.22 cnf(i_0_67, plain, (op_strict_equiv)). 14.71/2.22 cnf(i_0_69, plain, (op_strict_implies)). 14.71/2.22 cnf(i_0_74, plain, (op_implies)). 14.71/2.22 cnf(i_0_76, plain, (axiom_b)). 14.71/2.22 cnf(i_0_82, plain, (substitution_of_equivalents)). 14.71/2.22 cnf(i_0_58, plain, (not(necessarily(not(X1)))=possibly(X1))). 14.71/2.22 cnf(i_0_27, plain, (is_a_theorem(strict_implies(X1,possibly(X1))))). 14.71/2.22 cnf(i_0_61, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2))). 14.71/2.22 cnf(i_0_11, plain, (is_a_theorem(strict_implies(X1,and(X1,X1))))). 14.71/2.22 cnf(i_0_29, plain, (is_a_theorem(strict_implies(and(X1,X2),X1)))). 14.71/2.22 cnf(i_0_1, plain, (not(and(X1,not(X2)))=implies(X1,X2))). 14.71/2.22 cnf(i_0_47, plain, (is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1))))). 14.71/2.22 cnf(i_0_4, plain, (implies(not(X1),X2)=or(X1,X2))). 14.71/2.22 cnf(i_0_14, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))))). 14.71/2.22 cnf(i_0_3, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))). 14.71/2.22 cnf(i_0_59, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2))). 14.71/2.22 cnf(i_0_31, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(not(possibly(X2)),not(possibly(X1))))))). 14.71/2.22 cnf(i_0_13, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3)))))). 14.71/2.22 cnf(i_0_39, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))))). 14.71/2.22 cnf(i_0_81, negated_conjecture, (~axiom_4)). 14.71/2.22 cnf(i_0_21, plain, (~is_a_theorem(implies(necessarily(esk14_0),necessarily(necessarily(esk14_0)))))). 14.71/2.22 cnf(i_0_34, plain, (necessitation|~is_a_theorem(necessarily(esk22_0)))). 14.71/2.22 cnf(i_0_35, plain, (necessitation|is_a_theorem(esk22_0))). 14.71/2.22 cnf(i_0_48, plain, (axiom_M|~is_a_theorem(implies(necessarily(esk33_0),esk33_0)))). 14.71/2.22 cnf(i_0_33, plain, (is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1))). 14.71/2.22 cnf(i_0_9, plain, (axiom_B|~is_a_theorem(implies(esk3_0,necessarily(possibly(esk3_0)))))). 14.71/2.22 cnf(i_0_18, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2)))). 14.71/2.22 cnf(i_0_40, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2))). 14.71/2.22 cnf(i_0_23, plain, (axiom_5|~is_a_theorem(implies(possibly(esk15_0),necessarily(possibly(esk15_0)))))). 14.71/2.22 cnf(i_0_60, plain, (not(possibly(not(X1)))=necessarily(X1)|~op_necessarily)). 14.71/2.22 cnf(i_0_49, plain, (is_a_theorem(implies(necessarily(X1),X1))|~axiom_M)). 14.71/2.22 cnf(i_0_25, plain, (axiom_s4|~is_a_theorem(strict_implies(necessarily(esk16_0),necessarily(necessarily(esk16_0)))))). 14.71/2.22 cnf(i_0_56, plain, (axiom_m10|~is_a_theorem(strict_implies(possibly(esk39_0),necessarily(possibly(esk39_0)))))). 14.71/2.22 cnf(i_0_2, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)). 14.71/2.22 cnf(i_0_6, plain, (axiom_m7|~is_a_theorem(strict_implies(possibly(and(esk1_0,esk2_0)),esk1_0)))). 14.71/2.22 cnf(i_0_55, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1))). 14.71/2.22 cnf(i_0_8, plain, (is_a_theorem(implies(X1,necessarily(possibly(X1))))|~axiom_B)). 14.71/2.22 cnf(i_0_5, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)). 14.71/2.22 cnf(i_0_24, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|~axiom_5)). 14.71/2.22 cnf(i_0_36, plain, (axiom_m8|~is_a_theorem(strict_implies(strict_implies(esk23_0,esk24_0),strict_implies(possibly(esk23_0),possibly(esk24_0)))))). 14.71/2.22 cnf(i_0_7, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),X1))|~axiom_m7)). 14.71/2.22 cnf(i_0_20, plain, (axiom_K|~is_a_theorem(implies(strict_implies(esk12_0,esk13_0),implies(necessarily(esk12_0),necessarily(esk13_0)))))). 14.71/2.22 cnf(i_0_44, plain, (axiom_s2|~is_a_theorem(strict_implies(possibly(and(esk30_0,esk31_0)),and(possibly(esk30_0),possibly(esk31_0)))))). 14.71/2.22 cnf(i_0_57, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))|~axiom_m10)). 14.71/2.22 cnf(i_0_26, plain, (is_a_theorem(strict_implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_s4)). 14.71/2.22 cnf(i_0_50, plain, (axiom_s1|~is_a_theorem(implies(and(strict_implies(esk34_0,esk35_0),strict_implies(esk35_0,esk36_0)),strict_implies(esk34_0,esk36_0))))). 14.71/2.22 cnf(i_0_37, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(possibly(X1),possibly(X2))))|~axiom_m8)). 14.71/2.22 cnf(i_0_19, plain, (is_a_theorem(implies(strict_implies(X1,X2),implies(necessarily(X1),necessarily(X2))))|~axiom_K)). 14.71/2.22 cnf(i_0_45, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),and(possibly(X1),possibly(X2))))|~axiom_s2)). 14.71/2.22 cnf(i_0_51, plain, (is_a_theorem(implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_s1)). 14.71/2.22 cnf(i_0_147, plain, (X100=X100)). 14.71/2.22 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 14.71/2.22 # Begin printing tableau 14.71/2.22 # Found 7 steps 14.71/2.22 cnf(i_0_34, plain, (necessitation|~is_a_theorem(necessarily(esk22_0))), inference(start_rule)). 14.71/2.22 cnf(i_0_197, plain, (necessitation), inference(extension_rule, [i_0_33])). 14.71/2.22 cnf(i_0_20440, plain, (~is_a_theorem(strict_implies(X5,possibly(X5)))), inference(closure_rule, [i_0_27])). 14.71/2.22 cnf(i_0_20438, plain, (is_a_theorem(necessarily(strict_implies(X5,possibly(X5))))), inference(extension_rule, [i_0_55])). 14.71/2.22 cnf(i_0_20461, plain, (~is_a_theorem(strict_implies(X1,possibly(X1)))), inference(closure_rule, [i_0_27])). 14.71/2.22 cnf(i_0_198, plain, (~is_a_theorem(necessarily(esk22_0))), inference(etableau_closure_rule, [i_0_198, ...])). 14.71/2.22 cnf(i_0_20459, plain, (is_a_theorem(and(strict_implies(X1,possibly(X1)),necessarily(strict_implies(X5,possibly(X5)))))), inference(etableau_closure_rule, [i_0_20459, ...])). 14.71/2.22 # End printing tableau 14.71/2.22 # SZS output end 14.71/2.22 # Branches closed with saturation will be marked with an "s" 14.71/2.23 # Child (7547) has found a proof. 14.71/2.23 14.71/2.23 # Proof search is over... 14.71/2.23 # Freeing feature tree 14.71/2.25 EOF