0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/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 : n004.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Thu Jul 15 06:07:39 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.36 # No SInE strategy applied 0.12/0.36 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. 0.12/0.36 # 0.12/0.36 # Presaturation interreduction done 0.12/0.36 # Number of axioms: 23 Number of unprocessed: 23 0.12/0.36 # Tableaux proof search. 0.12/0.36 # APR header successfully linked. 0.12/0.36 # 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 # 23 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 23 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 # 0 extension rule candidate clauses 0.12/0.36 # 23 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 41 new_tableaux and 0 remaining starting tableaux. 0.12/0.36 # We now have 41 tableaux to operate on 708.56/89.63 # There were 19 total branch saturation attempts. 708.56/89.63 # There were 0 of these attempts blocked. 708.56/89.63 # There were 0 deferred branch saturation attempts. 708.56/89.63 # There were 0 free duplicated saturations. 708.56/89.63 # There were 1 total successful branch saturations. 708.56/89.63 # There were 0 successful branch saturations in interreduction. 708.56/89.63 # There were 0 successful branch saturations on the branch. 708.56/89.63 # There were 1 successful branch saturations after the branch. 708.56/89.63 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 708.56/89.63 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 708.56/89.63 # Begin clausification derivation 708.56/89.63 708.56/89.63 # End clausification derivation 708.56/89.63 # Begin listing active clauses obtained from FOF to CNF conversion 708.56/89.63 cnf(i_0_59, plain, (multiplication(X1,zero)=zero)). 708.56/89.63 cnf(i_0_54, plain, (multiplication(zero,X1)=zero)). 708.56/89.63 cnf(i_0_62, plain, (addition(X1,zero)=X1)). 708.56/89.63 cnf(i_0_45, plain, (multiplication(X1,one)=X1)). 708.56/89.63 cnf(i_0_44, plain, (multiplication(one,X1)=X1)). 708.56/89.63 cnf(i_0_51, plain, (addition(X1,X1)=X1)). 708.56/89.63 cnf(i_0_53, plain, (multiplication(antidomain(X1),X1)=zero)). 708.56/89.63 cnf(i_0_35, plain, (multiplication(X1,coantidomain(X1))=zero)). 708.56/89.63 cnf(i_0_34, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). 708.56/89.63 cnf(i_0_48, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). 708.56/89.63 cnf(i_0_47, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). 708.56/89.63 cnf(i_0_42, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). 708.56/89.63 cnf(i_0_57, negated_conjecture, (addition(antidomain(antidomain(sK2_goals_X1)),antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(sK1_goals_X2))))))))))))))=antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(sK1_goals_X2))))))))))))))). 708.56/89.63 cnf(i_0_50, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). 708.56/89.63 cnf(i_0_33, plain, (ifeq(X1,X1,X2,X3)=X2)). 708.56/89.63 cnf(i_0_43, plain, (ifeq2(X1,X1,X2,X3)=X2)). 708.56/89.63 cnf(i_0_38, plain, (ifeq2(addition(X1,X2),X2,leq(X1,X2),true)=true)). 708.56/89.63 cnf(i_0_49, plain, (ifeq(leq(X1,X2),true,addition(X1,X2),X2)=X2)). 708.56/89.63 cnf(i_0_52, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). 708.56/89.63 cnf(i_0_40, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). 708.56/89.63 cnf(i_0_56, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). 708.56/89.63 cnf(i_0_32, plain, (addition(X1,X2)=addition(X2,X1))). 708.56/89.63 cnf(i_0_41, negated_conjecture, (addition(antidomain(antidomain(sK1_goals_X2)),coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(sK2_goals_X1)))),sK3_goals_X0))))!=antidomain(antidomain(sK1_goals_X2)))). 708.56/89.63 cnf(i_0_65, plain, (X4=X4)). 708.56/89.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 708.56/89.63 # Begin printing tableau 708.56/89.63 # Found 6 steps 708.56/89.63 cnf(i_0_59, plain, (multiplication(X5,zero)=zero), inference(start_rule)). 708.56/89.63 cnf(i_0_76, plain, (multiplication(X5,zero)=zero), inference(extension_rule, [i_0_74])). 708.56/89.63 cnf(i_0_124, plain, (multiplication(X4,zero)!=zero), inference(closure_rule, [i_0_59])). 708.56/89.63 cnf(i_0_122, plain, (leq(multiplication(X5,zero),multiplication(X4,zero))=leq(zero,zero)), inference(extension_rule, [i_0_71])). 708.56/89.63 cnf(i_0_8572368, plain, (coantidomain(leq(multiplication(X5,zero),multiplication(X4,zero)))=coantidomain(leq(zero,zero))), inference(extension_rule, [i_0_73])). 708.56/89.63 cnf(i_0_9154014, plain, (antidomain(coantidomain(leq(multiplication(X5,zero),multiplication(X4,zero))))=antidomain(coantidomain(leq(zero,zero)))), inference(etableau_closure_rule, [i_0_9154014, ...])). 708.56/89.63 # End printing tableau 708.56/89.63 # SZS output end 708.56/89.63 # Branches closed with saturation will be marked with an "s" 708.56/89.65 # Child (28639) has found a proof. 708.56/89.65 708.56/89.65 # Proof search is over... 708.56/89.65 # Freeing feature tree 708.56/89.69 EOF