%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE147-10 : TPTP v8.1.0. Released v7.5.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n016.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sun Jul 17 01:57:18 EDT 2022 % Result : Unsatisfiable 44.01s 6.05s % Output : CNFRefutation 44.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KLE147-10 : TPTP v8.1.0. Released v7.5.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.12/0.34 % Computer : n016.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 16:06:04 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 23 Number of unprocessed: 23 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 23 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 23 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 0 extension rule candidate clauses % 0.12/0.37 # 23 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 47 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 47 tableaux to operate on % 44.01/6.05 # There were 1 total branch saturation attempts. % 44.01/6.05 # There were 0 of these attempts blocked. % 44.01/6.05 # There were 0 deferred branch saturation attempts. % 44.01/6.05 # There were 0 free duplicated saturations. % 44.01/6.05 # There were 1 total successful branch saturations. % 44.01/6.05 # There were 0 successful branch saturations in interreduction. % 44.01/6.05 # There were 0 successful branch saturations on the branch. % 44.01/6.05 # There were 1 successful branch saturations after the branch. % 44.01/6.05 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 44.01/6.05 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 44.01/6.05 # Begin clausification derivation % 44.01/6.05 % 44.01/6.05 # End clausification derivation % 44.01/6.05 # Begin listing active clauses obtained from FOF to CNF conversion % 44.01/6.05 cnf(i_0_36, plain, (multiplication(zero,X1)=zero)). % 44.01/6.05 cnf(i_0_32, plain, (multiplication(X1,one)=X1)). % 44.01/6.05 cnf(i_0_33, plain, (multiplication(one,X1)=X1)). % 44.01/6.05 cnf(i_0_29, plain, (addition(X1,zero)=X1)). % 44.01/6.05 cnf(i_0_30, plain, (addition(X1,X1)=X1)). % 44.01/6.05 cnf(i_0_24, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 44.01/6.05 cnf(i_0_25, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 44.01/6.05 cnf(i_0_26, plain, (ifeq(X1,X1,X2,X3)=X2)). % 44.01/6.05 cnf(i_0_28, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 44.01/6.05 cnf(i_0_41, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 44.01/6.05 cnf(i_0_37, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 44.01/6.05 cnf(i_0_38, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 44.01/6.05 cnf(i_0_43, plain, (addition(star(X1),multiplication(strong_iteration(X1),zero))=strong_iteration(X1))). % 44.01/6.05 cnf(i_0_31, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 44.01/6.05 cnf(i_0_34, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 44.01/6.05 cnf(i_0_45, plain, (ifeq3(addition(X1,X2),X2,leq(X1,X2),true)=true)). % 44.01/6.05 cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 44.01/6.05 cnf(i_0_44, plain, (ifeq2(leq(X1,X2),true,addition(X1,X2),X2)=X2)). % 44.01/6.05 cnf(i_0_42, plain, (ifeq(leq(X1,addition(multiplication(X2,X1),X3)),true,leq(X1,multiplication(strong_iteration(X2),X3)),true)=true)). % 44.01/6.05 cnf(i_0_40, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true)=true)). % 44.01/6.05 cnf(i_0_39, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true)=true)). % 44.01/6.05 cnf(i_0_27, plain, (addition(X1,X2)=addition(X2,X1))). % 44.01/6.05 cnf(i_0_46, 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))). % 44.01/6.05 cnf(i_0_48, plain, (X4=X4)). % 44.01/6.05 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 44.01/6.05 # Begin printing tableau % 44.01/6.05 # Found 5 steps % 44.01/6.05 cnf(i_0_36, plain, (multiplication(zero,X4)=zero), inference(start_rule)). % 44.01/6.05 cnf(i_0_61, plain, (multiplication(zero,X4)=zero), inference(extension_rule, [i_0_57])). % 44.01/6.05 cnf(i_0_113, plain, (star(multiplication(zero,X4))=star(zero)), inference(extension_rule, [i_0_51])). % 44.01/6.05 cnf(i_0_129, plain, (star(zero)!=multiplication(star(zero),one)), inference(closure_rule, [i_0_32])). % 44.01/6.05 cnf(i_0_127, plain, (star(multiplication(zero,X4))=multiplication(star(zero),one)), inference(etableau_closure_rule, [i_0_127, ...])). % 44.01/6.05 # End printing tableau % 44.01/6.05 # SZS output end % 44.01/6.05 # Branches closed with saturation will be marked with an "s" % 44.80/6.08 # Child (16522) has found a proof. % 44.80/6.08 % 44.80/6.08 # Proof search is over... % 44.80/6.08 # Freeing feature tree %------------------------------------------------------------------------------