0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.32 % Computer : n009.cluster.edu 0.10/0.32 % Model : x86_64 x86_64 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.32 % Memory : 8042.1875MB 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.32 % CPULimit : 1200 0.10/0.32 % WCLimit : 120 0.10/0.32 % DateTime : Tue Jul 13 15:26:42 EDT 2021 0.10/0.32 % 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_S04AN 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: 23 Number of unprocessed: 23 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 # 23 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 23 unit axioms. 0.16/0.35 # 1 start rule tableaux created. 0.16/0.35 # 0 extension rule candidate clauses 0.16/0.35 # 23 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 47 new_tableaux and 0 remaining starting tableaux. 0.16/0.35 # We now have 47 tableaux to operate on 584.77/74.34 # There were 7 total branch saturation attempts. 584.77/74.34 # There were 0 of these attempts blocked. 584.77/74.34 # There were 0 deferred branch saturation attempts. 584.77/74.34 # There were 0 free duplicated saturations. 584.77/74.34 # There were 1 total successful branch saturations. 584.77/74.34 # There were 0 successful branch saturations in interreduction. 584.77/74.34 # There were 0 successful branch saturations on the branch. 584.77/74.34 # There were 1 successful branch saturations after the branch. 584.77/74.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 584.77/74.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 584.77/74.34 # Begin clausification derivation 584.77/74.34 584.77/74.34 # End clausification derivation 584.77/74.34 # Begin listing active clauses obtained from FOF to CNF conversion 584.77/74.34 cnf(i_0_42, plain, (multiplication(zero,X1)=zero)). 584.77/74.34 cnf(i_0_24, plain, (multiplication(X1,one)=X1)). 584.77/74.34 cnf(i_0_25, plain, (multiplication(one,X1)=X1)). 584.77/74.34 cnf(i_0_30, plain, (addition(X1,zero)=X1)). 584.77/74.34 cnf(i_0_34, plain, (addition(X1,X1)=X1)). 584.77/74.34 cnf(i_0_32, plain, (ifeq(X1,X1,X2,X3)=X2)). 584.77/74.34 cnf(i_0_37, plain, (ifeq2(X1,X1,X2,X3)=X2)). 584.77/74.34 cnf(i_0_40, plain, (ifeq3(X1,X1,X2,X3)=X2)). 584.77/74.34 cnf(i_0_39, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). 584.77/74.34 cnf(i_0_45, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). 584.77/74.34 cnf(i_0_44, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). 584.77/74.34 cnf(i_0_26, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). 584.77/74.34 cnf(i_0_29, plain, (addition(star(X1),multiplication(strong_iteration(X1),zero))=strong_iteration(X1))). 584.77/74.34 cnf(i_0_41, plain, (ifeq3(addition(X1,X2),X2,leq(X1,X2),true)=true)). 584.77/74.34 cnf(i_0_38, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). 584.77/74.34 cnf(i_0_33, plain, (ifeq2(leq(X1,X2),true,addition(X1,X2),X2)=X2)). 584.77/74.34 cnf(i_0_36, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). 584.77/74.34 cnf(i_0_31, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). 584.77/74.34 cnf(i_0_43, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true)=true)). 584.77/74.34 cnf(i_0_46, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true)=true)). 584.77/74.34 cnf(i_0_28, plain, (ifeq(leq(X1,addition(multiplication(X2,X1),X3)),true,leq(X1,multiplication(strong_iteration(X2),X3)),true)=true)). 584.77/74.34 cnf(i_0_35, plain, (addition(X1,X2)=addition(X2,X1))). 584.77/74.34 cnf(i_0_27, negated_conjecture, (tuple(leq(multiplication(star(sK1_goals_X1),strong_iteration(multiplication(star(sK2_goals_X0),sK1_goals_X1))),strong_iteration(multiplication(star(sK2_goals_X0),sK1_goals_X1))),leq(strong_iteration(multiplication(star(sK4_goals_X0),sK3_goals_X1)),multiplication(star(sK3_goals_X1),strong_iteration(multiplication(star(sK4_goals_X0),sK3_goals_X1)))))!=tuple(true,true))). 584.77/74.34 cnf(i_0_48, plain, (X4=X4)). 584.77/74.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 584.77/74.34 # Begin printing tableau 584.77/74.34 # Found 10 steps 584.77/74.34 cnf(i_0_42, plain, (multiplication(zero,X5)=zero), inference(start_rule)). 584.77/74.34 cnf(i_0_61, plain, (multiplication(zero,X5)=zero), inference(extension_rule, [i_0_60])). 584.77/74.34 cnf(i_0_119, plain, (multiplication(zero,ifeq3(zero,zero,zero,zero))!=zero), inference(closure_rule, [i_0_42])). 584.77/74.34 cnf(i_0_120, plain, (multiplication(zero,ifeq3(zero,zero,zero,zero))!=zero), inference(closure_rule, [i_0_42])). 584.77/74.34 cnf(i_0_122, plain, (multiplication(zero,ifeq3(zero,zero,zero,zero))!=zero), inference(closure_rule, [i_0_42])). 584.77/74.34 cnf(i_0_118, plain, (ifeq3(multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,X5),multiplication(zero,ifeq3(zero,zero,zero,zero)))=ifeq3(zero,zero,zero,zero)), inference(extension_rule, [i_0_51])). 584.77/74.34 cnf(i_0_129, plain, (multiplication(ifeq3(zero,zero,zero,zero),one)!=ifeq3(zero,zero,zero,zero)), inference(closure_rule, [i_0_24])). 584.77/74.34 cnf(i_0_127, plain, (ifeq3(multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,X5),multiplication(zero,ifeq3(zero,zero,zero,zero)))=multiplication(ifeq3(zero,zero,zero,zero),one)), inference(extension_rule, [i_0_57])). 584.77/74.34 cnf(i_0_4504589, plain, (multiplication(zero,X1)!=zero), inference(closure_rule, [i_0_42])). 584.77/74.34 cnf(i_0_4504587, plain, (leq(ifeq3(multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,ifeq3(zero,zero,zero,zero)),multiplication(zero,X5),multiplication(zero,ifeq3(zero,zero,zero,zero))),multiplication(zero,X1))=leq(multiplication(ifeq3(zero,zero,zero,zero),one),zero)), inference(etableau_closure_rule, [i_0_4504587, ...])). 584.77/74.34 # End printing tableau 584.77/74.34 # SZS output end 584.77/74.34 # Branches closed with saturation will be marked with an "s" 584.77/74.36 # Child (2942) has found a proof. 584.77/74.36 584.77/74.36 # Proof search is over... 584.77/74.36 # Freeing feature tree 584.77/74.43 EOF