%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE113+1 : TPTP v8.1.0. Released v4.0.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:08 EDT 2022 % Result : Theorem 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KLE113+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/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.34 % Computer : n016.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 16 11:28:49 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 20 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 18 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 2 extension rule candidate clauses % 0.13/0.37 # 18 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 30 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 30 tableaux to operate on % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.19/0.37 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.19/0.37 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). % 0.19/0.37 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.19/0.37 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.19/0.37 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.19/0.37 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)). % 0.19/0.37 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.19/0.37 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.19/0.37 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 0.19/0.37 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 0.19/0.37 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.19/0.37 cnf(i_0_28, negated_conjecture, (antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero)))))!=zero)). % 0.19/0.37 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.19/0.37 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.19/0.37 cnf(i_0_34, plain, (X50=X50)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X4,zero)=zero), inference(start_rule)). % 0.19/0.37 cnf(i_0_43, plain, (multiplication(X4,zero)=zero), inference(extension_rule, [i_0_42])). % 0.19/0.37 cnf(i_0_89, plain, (coantidomain(multiplication(X4,zero))=coantidomain(zero)), inference(extension_rule, [i_0_37])). % 0.19/0.37 cnf(i_0_101, plain, (coantidomain(zero)!=addition(coantidomain(zero),zero)), inference(closure_rule, [i_0_3])). % 0.19/0.37 cnf(i_0_99, plain, (coantidomain(multiplication(X4,zero))=addition(coantidomain(zero),zero)), inference(etableau_closure_rule, [i_0_99, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.19/0.37 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.19/0.37 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). % 0.19/0.37 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.19/0.37 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.19/0.37 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.19/0.37 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)). % 0.19/0.37 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.19/0.37 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.19/0.37 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 0.19/0.37 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 0.19/0.37 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.19/0.37 cnf(i_0_28, negated_conjecture, (antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero)))))!=zero)). % 0.19/0.37 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.19/0.37 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.19/0.37 cnf(i_0_34, plain, (X50=X50)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X4,zero)=zero), inference(start_rule)). % 0.19/0.37 cnf(i_0_43, plain, (multiplication(X4,zero)=zero), inference(extension_rule, [i_0_41])). % 0.19/0.37 cnf(i_0_87, plain, (antidomain(multiplication(X4,zero))=antidomain(zero)), inference(extension_rule, [i_0_37])). % 0.19/0.37 cnf(i_0_101, plain, (antidomain(zero)!=addition(antidomain(zero),zero)), inference(closure_rule, [i_0_3])). % 0.19/0.37 cnf(i_0_99, plain, (antidomain(multiplication(X4,zero))=addition(antidomain(zero),zero)), inference(etableau_closure_rule, [i_0_99, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.19/0.37 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.19/0.37 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). % 0.19/0.37 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.19/0.37 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.19/0.37 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.19/0.37 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)). % 0.19/0.37 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.19/0.37 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.19/0.37 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.19/0.37 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 0.19/0.37 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 0.19/0.37 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 0.19/0.37 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.19/0.37 cnf(i_0_28, negated_conjecture, (antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero)))))!=zero)). % 0.19/0.37 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.19/0.37 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.19/0.37 cnf(i_0_34, plain, (X50=X50)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_10, plain, (multiplication(X7,zero)=zero), inference(start_rule)). % 0.19/0.37 cnf(i_0_43, plain, (multiplication(X7,zero)=zero), inference(extension_rule, [i_0_39])). % 0.19/0.37 cnf(i_0_81, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.19/0.37 cnf(i_0_80, plain, (multiplication(multiplication(zero,zero),multiplication(X7,zero))=multiplication(zero,zero)), inference(extension_rule, [i_0_37])). % 0.19/0.37 cnf(i_0_101, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.19/0.37 cnf(i_0_99, plain, (multiplication(multiplication(zero,zero),multiplication(X7,zero))=zero), inference(etableau_closure_rule, [i_0_99, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Child (30273) has found a proof. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------