%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE002+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 : n020.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:56:26 EDT 2022 % Result : Theorem 0.22s 0.41s % Output : CNFRefutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n020.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Thu Jun 16 13:12:04 EDT 2022 % 0.14/0.36 % CPUTime : % 0.22/0.39 # No SInE strategy applied % 0.22/0.39 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.22/0.39 # and selection function SelectNewComplexAHP. % 0.22/0.39 # % 0.22/0.39 # Number of axioms: 15 Number of unprocessed: 15 % 0.22/0.39 # Tableaux proof search. % 0.22/0.39 # APR header successfully linked. % 0.22/0.39 # Hello from C++ % 0.22/0.39 # The folding up rule is enabled... % 0.22/0.39 # Local unification is enabled... % 0.22/0.39 # Any saturation attempts will use folding labels... % 0.22/0.39 # 15 beginning clauses after preprocessing and clausification % 0.22/0.39 # Creating start rules for all 2 conjectures. % 0.22/0.39 # There are 2 start rule candidates: % 0.22/0.39 # Found 13 unit axioms. % 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.22/0.39 # 2 start rule tableaux created. % 0.22/0.39 # 2 extension rule candidate clauses % 0.22/0.39 # 13 unit axiom clauses % 0.22/0.39 % 0.22/0.39 # Requested 8, 32 cores available to the main process. % 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.22/0.39 # Creating equality axioms % 0.22/0.39 # Ran out of tableaux, making start rules for all clauses % 0.22/0.39 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.22/0.39 # We now have 17 tableaux to operate on % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_15, negated_conjecture, (leq(esk1_0,esk2_0))). % 0.22/0.41 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.22/0.41 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.22/0.41 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.22/0.41 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.22/0.41 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.22/0.41 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.22/0.41 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.22/0.41 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.22/0.41 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.22/0.41 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.22/0.41 cnf(i_0_14, negated_conjecture, (~leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)))). % 0.22/0.41 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_9, plain, (addition(multiplication(X1,X3),multiplication(X2,X3))=multiplication(addition(X1,X2),X3))). % 0.22/0.41 cnf(i_0_34, plain, (X32=X32)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 5 steps % 0.22/0.41 cnf(i_0_15, negated_conjecture, (leq(esk1_0,esk2_0)), inference(start_rule)). % 0.22/0.41 cnf(i_0_41, plain, (leq(esk1_0,esk2_0)), inference(extension_rule, [i_0_13])). % 0.22/0.41 cnf(i_0_59, plain, (addition(esk1_0,esk2_0)=esk2_0), inference(extension_rule, [i_0_37])). % 0.22/0.41 cnf(i_0_90, plain, (esk2_0!=addition(esk2_0,zero)), inference(closure_rule, [i_0_3])). % 0.22/0.41 cnf(i_0_88, plain, (addition(esk1_0,esk2_0)=addition(esk2_0,zero)), inference(etableau_closure_rule, [i_0_88, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_15, negated_conjecture, (leq(esk1_0,esk2_0))). % 0.22/0.41 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.22/0.41 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.22/0.41 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.22/0.41 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.22/0.41 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.22/0.41 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.22/0.41 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.22/0.41 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.22/0.41 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.22/0.41 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.22/0.41 cnf(i_0_14, negated_conjecture, (~leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)))). % 0.22/0.41 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_9, plain, (addition(multiplication(X1,X3),multiplication(X2,X3))=multiplication(addition(X1,X2),X3))). % 0.22/0.41 cnf(i_0_34, plain, (X32=X32)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 5 steps % 0.22/0.41 cnf(i_0_11, plain, (multiplication(zero,X4)=zero), inference(start_rule)). % 0.22/0.41 cnf(i_0_43, plain, (multiplication(zero,X4)=zero), inference(extension_rule, [i_0_37])). % 0.22/0.41 cnf(i_0_90, plain, (multiplication(X4,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.22/0.41 cnf(i_0_88, plain, (multiplication(zero,X4)=multiplication(X4,zero)), inference(extension_rule, [i_0_35])). % 0.22/0.41 cnf(i_0_95, plain, (multiplication(X4,zero)=multiplication(zero,X4)), inference(etableau_closure_rule, [i_0_95, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_15, negated_conjecture, (leq(esk1_0,esk2_0))). % 0.22/0.41 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.22/0.41 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.22/0.41 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.22/0.41 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.22/0.41 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.22/0.41 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.22/0.41 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.22/0.41 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.22/0.41 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.22/0.41 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.22/0.41 cnf(i_0_14, negated_conjecture, (~leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)))). % 0.22/0.41 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_9, plain, (addition(multiplication(X1,X3),multiplication(X2,X3))=multiplication(addition(X1,X2),X3))). % 0.22/0.41 cnf(i_0_34, plain, (X32=X32)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 6 steps % 0.22/0.41 cnf(i_0_10, plain, (multiplication(X1,zero)=zero), inference(start_rule)). % 0.22/0.41 cnf(i_0_42, plain, (multiplication(X1,zero)=zero), inference(extension_rule, [i_0_37])). % 0.22/0.41 cnf(i_0_90, plain, (multiplication(X1,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.22/0.41 cnf(i_0_88, plain, (multiplication(X1,zero)=multiplication(X1,zero)), inference(extension_rule, [i_0_38])). % 0.22/0.41 cnf(i_0_101, plain, (multiplication(X1,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.22/0.41 cnf(i_0_99, plain, (addition(multiplication(X1,zero),multiplication(X1,zero))=addition(multiplication(X1,zero),zero)), inference(etableau_closure_rule, [i_0_99, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_15, negated_conjecture, (leq(esk1_0,esk2_0))). % 0.22/0.41 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.22/0.41 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.22/0.41 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.22/0.41 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.22/0.41 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.22/0.41 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.22/0.41 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.22/0.41 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.22/0.41 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.22/0.41 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.22/0.41 cnf(i_0_14, negated_conjecture, (~leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)))). % 0.22/0.41 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.22/0.41 cnf(i_0_9, plain, (addition(multiplication(X1,X3),multiplication(X2,X3))=multiplication(addition(X1,X2),X3))). % 0.22/0.41 cnf(i_0_34, plain, (X32=X32)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 6 steps % 0.22/0.41 cnf(i_0_6, plain, (multiplication(zero,one)=zero), inference(start_rule)). % 0.22/0.41 cnf(i_0_45, plain, (multiplication(zero,one)=zero), inference(extension_rule, [i_0_37])). % 0.22/0.41 cnf(i_0_89, plain, (multiplication(zero,one)!=zero), inference(closure_rule, [i_0_11])). % 0.22/0.41 cnf(i_0_88, plain, (zero=zero), inference(extension_rule, [i_0_38])). % 0.22/0.41 cnf(i_0_101, plain, (multiplication(X1,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.22/0.41 cnf(i_0_99, plain, (addition(zero,multiplication(X1,zero))=addition(zero,zero)), inference(etableau_closure_rule, [i_0_99, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # Child (18803) has found a proof. % 0.22/0.41 % 0.22/0.41 # Proof search is over... % 0.22/0.41 # Freeing feature tree %------------------------------------------------------------------------------