0.07/0.12 % 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.34 % Computer : n027.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 13:45:10 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.37 # No SInE strategy applied 0.13/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V 0.13/0.37 # and selection function PSelectComplexExceptRRHorn. 0.13/0.37 # 0.13/0.37 # Presaturation interreduction done 0.13/0.37 # Number of axioms: 5 Number of unprocessed: 5 0.13/0.37 # Tableaux proof search. 0.13/0.37 # APR header successfully linked. 0.13/0.37 # Hello from C++ 0.13/0.37 # The folding up rule is enabled... 0.13/0.37 # Local unification is enabled... 0.13/0.37 # Any saturation attempts will use folding labels... 0.13/0.37 # 5 beginning clauses after preprocessing and clausification 0.13/0.37 # Creating start rules for all 5 conjectures. 0.13/0.37 # There are 5 start rule candidates: 0.13/0.37 # Found 4 unit axioms. 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.13/0.37 # 5 start rule tableaux created. 0.13/0.37 # 1 extension rule candidate clauses 0.13/0.37 # 4 unit axiom clauses 0.13/0.37 0.13/0.37 # Requested 8, 32 cores available to the main process. 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5 0.13/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.13/0.37 # We now have 8 tableaux to operate on 0.13/0.37 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. 0.13/0.37 # There were 0 total branch saturation attempts. 0.13/0.37 # There were 0 of these attempts blocked. 0.13/0.37 # There were 0 deferred branch saturation attempts. 0.13/0.37 # There were 0 free duplicated saturations. 0.13/0.37 # There were 0 total successful branch saturations. 0.13/0.37 # There were 0 successful branch saturations in interreduction. 0.13/0.37 # There were 0 successful branch saturations on the branch. 0.13/0.37 # There were 0 successful branch saturations after the branch. 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.37 # Begin clausification derivation 0.13/0.37 0.13/0.37 # End clausification derivation 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). 0.13/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). 0.13/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). 0.13/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). 0.13/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.37 # Begin printing tableau 0.13/0.37 # Found 6 steps 0.13/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(esk1_0,implies(X7,esk1_0)))), inference(start_rule)). 0.13/0.37 cnf(i_0_12, plain, (a_truth(implies(esk1_0,implies(X7,esk1_0)))), inference(extension_rule, [i_0_5])). 0.13/0.37 cnf(i_0_25, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). 0.13/0.37 cnf(i_0_26, plain, (~a_truth(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). 0.13/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(esk1_0,implies(implies(X7,esk1_0),esk1_0)),implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0))))), inference(closure_rule, [i_0_3])). 0.13/0.37 cnf(i_0_30, plain, (~a_truth(implies(esk1_0,implies(implies(X7,esk1_0),esk1_0)))), inference(closure_rule, [i_0_4])). 0.13/0.37 # End printing tableau 0.13/0.37 # SZS output end 0.13/0.37 # Branches closed with saturation will be marked with an "s" 0.13/0.37 # Child (17648) has found a proof. 0.13/0.37 0.13/0.37 # Proof search is over... 0.13/0.37 # Freeing feature tree 0.13/0.37 EOF