%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE040+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 : n004.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:46 EDT 2022 % Result : Theorem 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : KLE040+1 : TPTP v8.1.0. Released v4.0.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 : n004.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 16:25:53 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___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 18 Number of unprocessed: 18 % 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 # 18 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 14 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 4 extension rule candidate clauses % 0.13/0.38 # 14 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 27 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 27 tableaux to operate on % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.20/0.42 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.20/0.42 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.42 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.42 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.42 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.42 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.42 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))). % 0.20/0.42 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))). % 0.20/0.42 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.42 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.42 cnf(i_0_18, negated_conjecture, (multiplication(star(esk1_0),star(esk1_0))!=star(esk1_0))). % 0.20/0.42 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.42 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.42 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.42 cnf(i_0_28, plain, (X36=X36)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X7,zero)=zero), inference(start_rule)). % 0.20/0.42 cnf(i_0_36, plain, (multiplication(X7,zero)=zero), inference(extension_rule, [i_0_33])). % 0.20/0.42 cnf(i_0_78, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_77, plain, (multiplication(multiplication(zero,zero),multiplication(X7,zero))=multiplication(zero,zero)), inference(extension_rule, [i_0_31])). % 0.20/0.42 cnf(i_0_100, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_98, plain, (multiplication(multiplication(zero,zero),multiplication(X7,zero))=zero), inference(etableau_closure_rule, [i_0_98, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.20/0.42 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.20/0.42 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.42 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.42 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.42 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.42 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.42 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))). % 0.20/0.42 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))). % 0.20/0.42 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.42 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.42 cnf(i_0_18, negated_conjecture, (multiplication(star(esk1_0),star(esk1_0))!=star(esk1_0))). % 0.20/0.42 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.42 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.42 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.42 cnf(i_0_28, plain, (X36=X36)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X6,zero)=zero), inference(start_rule)). % 0.20/0.42 cnf(i_0_36, plain, (multiplication(X6,zero)=zero), inference(extension_rule, [i_0_33])). % 0.20/0.42 cnf(i_0_79, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_77, plain, (multiplication(multiplication(X6,zero),multiplication(zero,zero))=multiplication(zero,zero)), inference(extension_rule, [i_0_31])). % 0.20/0.42 cnf(i_0_100, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_98, plain, (multiplication(multiplication(X6,zero),multiplication(zero,zero))=zero), inference(etableau_closure_rule, [i_0_98, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.20/0.42 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.20/0.42 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.42 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.42 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.42 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.42 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.42 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))). % 0.20/0.42 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))). % 0.20/0.42 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.42 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.42 cnf(i_0_18, negated_conjecture, (multiplication(star(esk1_0),star(esk1_0))!=star(esk1_0))). % 0.20/0.42 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.42 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.42 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.42 cnf(i_0_28, plain, (X36=X36)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X7,zero)=zero), inference(start_rule)). % 0.20/0.42 cnf(i_0_36, plain, (multiplication(X7,zero)=zero), inference(extension_rule, [i_0_32])). % 0.20/0.42 cnf(i_0_75, plain, (multiplication(addition(zero,zero),zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_74, plain, (addition(multiplication(addition(zero,zero),zero),multiplication(X7,zero))=addition(zero,zero)), inference(extension_rule, [i_0_31])). % 0.20/0.42 cnf(i_0_100, plain, (addition(zero,zero)!=multiplication(addition(zero,zero),one)), inference(closure_rule, [i_0_6])). % 0.20/0.42 cnf(i_0_98, plain, (addition(multiplication(addition(zero,zero),zero),multiplication(X7,zero))=multiplication(addition(zero,zero),one)), inference(etableau_closure_rule, [i_0_98, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 0.20/0.42 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 0.20/0.42 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.42 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.42 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.42 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.42 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.42 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))). % 0.20/0.42 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))). % 0.20/0.42 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.42 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.42 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.42 cnf(i_0_18, negated_conjecture, (multiplication(star(esk1_0),star(esk1_0))!=star(esk1_0))). % 0.20/0.42 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.42 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.42 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.42 cnf(i_0_28, plain, (X36=X36)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_10, plain, (multiplication(X6,zero)=zero), inference(start_rule)). % 0.20/0.42 cnf(i_0_36, plain, (multiplication(X6,zero)=zero), inference(extension_rule, [i_0_32])). % 0.20/0.42 cnf(i_0_76, plain, (multiplication(addition(zero,zero),zero)!=zero), inference(closure_rule, [i_0_10])). % 0.20/0.42 cnf(i_0_74, plain, (addition(multiplication(X6,zero),multiplication(addition(zero,zero),zero))=addition(zero,zero)), inference(extension_rule, [i_0_31])). % 0.20/0.42 cnf(i_0_100, plain, (addition(zero,zero)!=multiplication(addition(zero,zero),one)), inference(closure_rule, [i_0_6])). % 0.20/0.42 cnf(i_0_98, plain, (addition(multiplication(X6,zero),multiplication(addition(zero,zero),zero))=multiplication(addition(zero,zero),one)), inference(etableau_closure_rule, [i_0_98, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # Child (19055) has found a proof. % 0.20/0.42 % 0.20/0.42 # Proof search is over... % 0.20/0.42 # Freeing feature tree %------------------------------------------------------------------------------