0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.12/0.33 Computer : n022.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 04:20:16 EDT 2022 0.12/0.33 % CPUTime : 0.12/0.35 # No SInE strategy applied 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.12/0.35 # 0.12/0.35 # Presaturation interreduction done 0.12/0.35 # Number of axioms: 19 Number of unprocessed: 19 0.12/0.35 # Tableaux proof search. 0.12/0.35 # APR header successfully linked. 0.12/0.35 # Hello from C++ 0.12/0.36 # The folding up rule is enabled... 0.12/0.36 # Local unification is enabled... 0.12/0.36 # Any saturation attempts will use folding labels... 0.12/0.36 # 19 beginning clauses after preprocessing and clausification 0.12/0.36 # Creating start rules for all 2 conjectures. 0.12/0.36 # There are 2 start rule candidates: 0.12/0.36 # Found 15 unit axioms. 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.12/0.36 # 2 start rule tableaux created. 0.12/0.36 # 4 extension rule candidate clauses 0.12/0.36 # 15 unit axiom clauses 0.12/0.36 0.12/0.36 # Requested 8, 32 cores available to the main process. 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 0.12/0.36 # Creating equality axioms 0.12/0.36 # Ran out of tableaux, making start rules for all clauses 0.12/0.36 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. 0.12/0.36 # We now have 21 tableaux to operate on 132.02/16.98 # There were 7 total branch saturation attempts. 132.02/16.98 # There were 0 of these attempts blocked. 132.02/16.98 # There were 0 deferred branch saturation attempts. 132.02/16.98 # There were 0 free duplicated saturations. 132.02/16.98 # There were 1 total successful branch saturations. 132.02/16.98 # There were 0 successful branch saturations in interreduction. 132.02/16.98 # There were 0 successful branch saturations on the branch. 132.02/16.98 # There were 1 successful branch saturations after the branch. 132.02/16.98 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 132.02/16.98 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 132.02/16.98 # Begin clausification derivation 132.02/16.98 132.02/16.98 # End clausification derivation 132.02/16.98 # Begin listing active clauses obtained from FOF to CNF conversion 132.02/16.98 cnf(i_0_19, negated_conjecture, (leq(esk1_0,esk2_0))). 132.02/16.98 cnf(i_0_8, plain, (multiplication(X1,zero)=zero)). 132.02/16.98 cnf(i_0_17, plain, (multiplication(zero,X1)=zero)). 132.02/16.98 cnf(i_0_11, plain, (multiplication(one,X1)=X1)). 132.02/16.98 cnf(i_0_13, plain, (addition(X1,zero)=X1)). 132.02/16.98 cnf(i_0_15, plain, (multiplication(X1,one)=X1)). 132.02/16.98 cnf(i_0_10, plain, (addition(X1,X1)=X1)). 132.02/16.98 cnf(i_0_3, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))). 132.02/16.98 cnf(i_0_16, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))). 132.02/16.98 cnf(i_0_6, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). 132.02/16.98 cnf(i_0_14, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). 132.02/16.98 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). 132.02/16.98 cnf(i_0_5, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). 132.02/16.98 cnf(i_0_7, plain, (addition(X1,X2)=addition(X2,X1))). 132.02/16.98 cnf(i_0_18, negated_conjecture, (~leq(star(esk1_0),star(esk2_0)))). 132.02/16.98 cnf(i_0_2, plain, (addition(X1,X2)=X2|~leq(X1,X2))). 132.02/16.98 cnf(i_0_1, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). 132.02/16.98 cnf(i_0_12, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). 132.02/16.98 cnf(i_0_4, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). 132.02/16.98 cnf(i_0_54, plain, (X38=X38)). 132.02/16.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 132.02/16.98 # Begin printing tableau 132.02/16.98 # Found 7 steps 132.02/16.98 cnf(i_0_13, plain, (addition(X3,zero)=X3), inference(start_rule)). 132.02/16.98 cnf(i_0_66, plain, (addition(X3,zero)=X3), inference(extension_rule, [i_0_59])). 132.02/16.98 cnf(i_0_571025, plain, (multiplication(X1,zero)!=zero), inference(closure_rule, [i_0_8])). 132.02/16.98 cnf(i_0_571023, plain, (addition(addition(X3,zero),multiplication(X1,zero))=addition(X3,zero)), inference(extension_rule, [i_0_60])). 132.02/16.98 cnf(i_0_571032, plain, (star(addition(addition(X3,zero),multiplication(X1,zero)))=star(addition(X3,zero))), inference(extension_rule, [i_0_61])). 132.02/16.98 cnf(i_0_674097, plain, (multiplication(X1,zero)!=zero), inference(closure_rule, [i_0_8])). 132.02/16.98 cnf(i_0_674095, plain, (multiplication(star(addition(addition(X3,zero),multiplication(X1,zero))),multiplication(X1,zero))=multiplication(star(addition(X3,zero)),zero)), inference(etableau_closure_rule, [i_0_674095, ...])). 132.02/16.98 # End printing tableau 132.02/16.98 # SZS output end 132.02/16.98 # Branches closed with saturation will be marked with an "s" 132.02/16.99 # Child (2061) has found a proof. 132.02/16.99 132.02/16.99 # Proof search is over... 132.02/16.99 # Freeing feature tree 132.02/17.02 EOF