%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE084-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 : n022.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:00 EDT 2022 % Result : Unsatisfiable 42.37s 5.81s % Output : CNFRefutation 42.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : KLE084-10 : TPTP v8.1.0. Released v7.5.0. % 0.12/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.35 % Computer : n022.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 16 10:09:02 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 22 Number of unprocessed: 22 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 22 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 22 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 0 extension rule candidate clauses % 0.13/0.38 # 22 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 40 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 40 tableaux to operate on % 42.37/5.81 # There were 1 total branch saturation attempts. % 42.37/5.81 # There were 0 of these attempts blocked. % 42.37/5.81 # There were 0 deferred branch saturation attempts. % 42.37/5.81 # There were 0 free duplicated saturations. % 42.37/5.81 # There were 1 total successful branch saturations. % 42.37/5.81 # There were 0 successful branch saturations in interreduction. % 42.37/5.81 # There were 0 successful branch saturations on the branch. % 42.37/5.81 # There were 1 successful branch saturations after the branch. % 42.37/5.81 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 42.37/5.81 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 42.37/5.81 # Begin clausification derivation % 42.37/5.81 % 42.37/5.81 # End clausification derivation % 42.37/5.81 # Begin listing active clauses obtained from FOF to CNF conversion % 42.37/5.81 cnf(i_0_36, plain, (multiplication(X1,zero)=zero)). % 42.37/5.81 cnf(i_0_37, plain, (multiplication(zero,X1)=zero)). % 42.37/5.81 cnf(i_0_29, plain, (addition(X1,zero)=X1)). % 42.37/5.81 cnf(i_0_32, plain, (multiplication(X1,one)=X1)). % 42.37/5.81 cnf(i_0_33, plain, (multiplication(one,X1)=X1)). % 42.37/5.81 cnf(i_0_30, plain, (addition(X1,X1)=X1)). % 42.37/5.81 cnf(i_0_44, plain, (multiplication(X1,coantidomain(X1))=zero)). % 42.37/5.81 cnf(i_0_40, plain, (multiplication(antidomain(X1),X1)=zero)). % 42.37/5.81 cnf(i_0_42, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 42.37/5.81 cnf(i_0_46, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 42.37/5.81 cnf(i_0_28, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 42.37/5.81 cnf(i_0_31, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 42.37/5.81 cnf(i_0_25, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 42.37/5.81 cnf(i_0_26, plain, (ifeq(X1,X1,X2,X3)=X2)). % 42.37/5.81 cnf(i_0_34, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 42.37/5.81 cnf(i_0_39, plain, (ifeq2(addition(X1,X2),X2,leq(X1,X2),true)=true)). % 42.37/5.81 cnf(i_0_38, plain, (ifeq(leq(X1,X2),true,addition(X1,X2),X2)=X2)). % 42.37/5.81 cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 42.37/5.81 cnf(i_0_41, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 42.37/5.81 cnf(i_0_45, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 42.37/5.81 cnf(i_0_27, plain, (addition(X1,X2)=addition(X2,X1))). % 42.37/5.81 cnf(i_0_48, negated_conjecture, (antidomain(antidomain(multiplication(sK2_goals_X0,antidomain(antidomain(sK1_goals_X1)))))!=antidomain(antidomain(multiplication(sK2_goals_X0,sK1_goals_X1))))). % 42.37/5.81 cnf(i_0_50, plain, (X4=X4)). % 42.37/5.81 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 42.37/5.81 # Begin printing tableau % 42.37/5.81 # Found 6 steps % 42.37/5.81 cnf(i_0_36, plain, (multiplication(X6,zero)=zero), inference(start_rule)). % 42.37/5.81 cnf(i_0_61, plain, (multiplication(X6,zero)=zero), inference(extension_rule, [i_0_56])). % 42.37/5.81 cnf(i_0_103, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_36])). % 42.37/5.81 cnf(i_0_101, plain, (addition(multiplication(X6,zero),multiplication(zero,zero))=addition(zero,zero)), inference(extension_rule, [i_0_53])). % 42.37/5.81 cnf(i_0_120, plain, (addition(zero,zero)!=zero), inference(closure_rule, [i_0_29])). % 42.37/5.81 cnf(i_0_118, plain, (addition(multiplication(X6,zero),multiplication(zero,zero))=zero), inference(etableau_closure_rule, [i_0_118, ...])). % 42.37/5.81 # End printing tableau % 42.37/5.81 # SZS output end % 42.37/5.81 # Branches closed with saturation will be marked with an "s" % 43.17/5.82 # Child (31475) has found a proof. % 43.17/5.82 % 43.17/5.82 # Proof search is over... % 43.17/5.82 # Freeing feature tree %------------------------------------------------------------------------------