%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE142+2 : 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 : n008.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:16 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : KLE142+2 : TPTP v8.1.0. Released v4.0.0. % 0.06/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 : n008.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 09:25:37 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 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 14 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 6 extension rule candidate clauses % 0.13/0.37 # 14 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 29 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 29 tableaux to operate on % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.39 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.39 cnf(i_0_10, plain, (multiplication(zero,X1)=zero)). % 0.20/0.39 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.39 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.39 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_15, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_11, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 0.20/0.39 cnf(i_0_12, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 0.20/0.39 cnf(i_0_17, plain, (addition(multiplication(strong_iteration(X1),zero),star(X1))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.39 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.39 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (~leq(strong_iteration(one),strong_iteration(strong_iteration(esk1_0)))|~leq(strong_iteration(strong_iteration(esk1_0)),strong_iteration(one)))). % 0.20/0.39 cnf(i_0_19, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.39 cnf(i_0_18, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.39 cnf(i_0_16, plain, (leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_14, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.39 cnf(i_0_13, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.39 cnf(i_0_107, plain, (X40=X40)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 9 steps % 0.20/0.39 cnf(i_0_6, plain, (multiplication(zero,one)=zero), inference(start_rule)). % 0.20/0.39 cnf(i_0_116, plain, (multiplication(zero,one)=zero), inference(extension_rule, [i_0_114])). % 0.20/0.39 cnf(i_0_172, plain, (multiplication(zero,one)!=zero), inference(closure_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_170, plain, (leq(zero,zero)), inference(extension_rule, [i_0_19])). % 0.20/0.39 cnf(i_0_176, plain, (addition(zero,zero)=zero), inference(extension_rule, [i_0_110])). % 0.20/0.39 cnf(i_0_193, plain, (zero!=addition(zero,zero)), inference(closure_rule, [i_0_3])). % 0.20/0.39 cnf(i_0_173, plain, (~leq(multiplication(zero,one),multiplication(zero,one))), inference(extension_rule, [i_0_18])). % 0.20/0.39 cnf(i_0_196, plain, (addition(multiplication(zero,one),multiplication(zero,one))!=multiplication(zero,one)), inference(closure_rule, [i_0_4])). % 0.20/0.39 cnf(i_0_192, plain, (zero=zero), inference(etableau_closure_rule, [i_0_192, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.39 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.39 cnf(i_0_10, plain, (multiplication(zero,X1)=zero)). % 0.20/0.39 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.39 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.39 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_15, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_11, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 0.20/0.39 cnf(i_0_12, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 0.20/0.39 cnf(i_0_17, plain, (addition(multiplication(strong_iteration(X1),zero),star(X1))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.39 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.39 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (~leq(strong_iteration(one),strong_iteration(strong_iteration(esk1_0)))|~leq(strong_iteration(strong_iteration(esk1_0)),strong_iteration(one)))). % 0.20/0.39 cnf(i_0_19, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.39 cnf(i_0_18, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.39 cnf(i_0_16, plain, (leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_14, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.39 cnf(i_0_13, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.39 cnf(i_0_107, plain, (X40=X40)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 9 steps % 0.20/0.39 cnf(i_0_6, plain, (multiplication(zero,one)=zero), inference(start_rule)). % 0.20/0.39 cnf(i_0_116, plain, (multiplication(zero,one)=zero), inference(extension_rule, [i_0_114])). % 0.20/0.39 cnf(i_0_171, plain, (multiplication(zero,one)!=zero), inference(closure_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_170, plain, (leq(zero,zero)), inference(extension_rule, [i_0_19])). % 0.20/0.39 cnf(i_0_176, plain, (addition(zero,zero)=zero), inference(extension_rule, [i_0_110])). % 0.20/0.39 cnf(i_0_193, plain, (zero!=addition(zero,zero)), inference(closure_rule, [i_0_3])). % 0.20/0.39 cnf(i_0_173, plain, (~leq(multiplication(zero,one),multiplication(zero,one))), inference(extension_rule, [i_0_18])). % 0.20/0.39 cnf(i_0_196, plain, (addition(multiplication(zero,one),multiplication(zero,one))!=multiplication(zero,one)), inference(closure_rule, [i_0_4])). % 0.20/0.39 cnf(i_0_192, plain, (zero=zero), inference(etableau_closure_rule, [i_0_192, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.39 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.39 cnf(i_0_10, plain, (multiplication(zero,X1)=zero)). % 0.20/0.39 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.39 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.39 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_15, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_11, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 0.20/0.39 cnf(i_0_12, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 0.20/0.39 cnf(i_0_17, plain, (addition(multiplication(strong_iteration(X1),zero),star(X1))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.39 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.39 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (~leq(strong_iteration(one),strong_iteration(strong_iteration(esk1_0)))|~leq(strong_iteration(strong_iteration(esk1_0)),strong_iteration(one)))). % 0.20/0.39 cnf(i_0_19, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.39 cnf(i_0_18, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.39 cnf(i_0_16, plain, (leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_14, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.39 cnf(i_0_13, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.39 cnf(i_0_107, plain, (X40=X40)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X3,one)=X3), inference(start_rule)). % 0.20/0.39 cnf(i_0_116, plain, (multiplication(X3,one)=X3), inference(extension_rule, [i_0_115])). % 0.20/0.39 cnf(i_0_174, plain, (strong_iteration(multiplication(X3,one))=strong_iteration(X3)), inference(extension_rule, [i_0_110])). % 0.20/0.39 cnf(i_0_194, plain, (strong_iteration(X3)!=multiplication(strong_iteration(X3),one)), inference(closure_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_192, plain, (strong_iteration(multiplication(X3,one))=multiplication(strong_iteration(X3),one)), inference(etableau_closure_rule, [i_0_192, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # Child (5144) has found a proof. % 0.20/0.39 % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 0.20/0.39 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 0.20/0.39 cnf(i_0_10, plain, (multiplication(zero,X1)=zero)). % 0.20/0.39 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 0.20/0.39 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 0.20/0.39 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_15, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_11, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 0.20/0.39 cnf(i_0_12, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 0.20/0.39 cnf(i_0_17, plain, (addition(multiplication(strong_iteration(X1),zero),star(X1))=strong_iteration(X1))). % 0.20/0.39 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 0.20/0.39 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 0.20/0.39 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 0.20/0.39 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (~leq(strong_iteration(one),strong_iteration(strong_iteration(esk1_0)))|~leq(strong_iteration(strong_iteration(esk1_0)),strong_iteration(one)))). % 0.20/0.39 cnf(i_0_19, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 0.20/0.39 cnf(i_0_18, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 0.20/0.39 cnf(i_0_16, plain, (leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_14, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 0.20/0.39 cnf(i_0_13, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 0.20/0.39 cnf(i_0_107, plain, (X40=X40)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_6, plain, (multiplication(X3,one)=X3), inference(start_rule)). % 0.20/0.39 cnf(i_0_116, plain, (multiplication(X3,one)=X3), inference(extension_rule, [i_0_113])). % 0.20/0.39 cnf(i_0_168, plain, (star(multiplication(X3,one))=star(X3)), inference(extension_rule, [i_0_110])). % 0.20/0.39 cnf(i_0_194, plain, (star(X3)!=multiplication(star(X3),one)), inference(closure_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_192, plain, (star(multiplication(X3,one))=multiplication(star(X3),one)), inference(etableau_closure_rule, [i_0_192, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------