%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE139+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 : n011.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:14 EDT 2022 % Result : Theorem 2.16s 0.62s % Output : CNFRefutation 2.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KLE139+2 : TPTP v8.1.0. Released v4.0.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jun 16 12:00:21 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 20 Number of unprocessed: 20 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 20 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 14 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 6 extension rule candidate clauses % 0.18/0.36 # 14 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 29 tableaux to operate on % 2.16/0.62 # There were 1 total branch saturation attempts. % 2.16/0.62 # There were 0 of these attempts blocked. % 2.16/0.62 # There were 0 deferred branch saturation attempts. % 2.16/0.62 # There were 0 free duplicated saturations. % 2.16/0.62 # There were 1 total successful branch saturations. % 2.16/0.62 # There were 0 successful branch saturations in interreduction. % 2.16/0.62 # There were 0 successful branch saturations on the branch. % 2.16/0.62 # There were 1 successful branch saturations after the branch. % 2.16/0.62 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.16/0.62 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.16/0.62 # Begin clausification derivation % 2.16/0.62 % 2.16/0.62 # End clausification derivation % 2.16/0.62 # Begin listing active clauses obtained from FOF to CNF conversion % 2.16/0.62 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 2.16/0.62 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 2.16/0.62 cnf(i_0_10, plain, (multiplication(zero,X1)=zero)). % 2.16/0.62 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 2.16/0.62 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 2.16/0.62 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 2.16/0.62 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 2.16/0.62 cnf(i_0_15, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))). % 2.16/0.62 cnf(i_0_11, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))). % 2.16/0.62 cnf(i_0_12, plain, (addition(one,multiplication(star(X1),X1))=star(X1))). % 2.16/0.62 cnf(i_0_17, plain, (addition(star(X1),multiplication(strong_iteration(X1),zero))=strong_iteration(X1))). % 2.16/0.62 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 2.16/0.62 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 2.16/0.62 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 2.16/0.62 cnf(i_0_19, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 2.16/0.62 cnf(i_0_18, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 2.16/0.62 cnf(i_0_20, negated_conjecture, (~leq(strong_iteration(esk1_0),addition(one,multiplication(strong_iteration(esk1_0),esk1_0)))|~leq(addition(one,multiplication(strong_iteration(esk1_0),esk1_0)),strong_iteration(esk1_0)))). % 2.16/0.62 cnf(i_0_16, plain, (leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3)))). % 2.16/0.62 cnf(i_0_14, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))). % 2.16/0.62 cnf(i_0_13, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))). % 2.16/0.62 cnf(i_0_107, plain, (X40=X40)). % 2.16/0.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.16/0.62 # Begin printing tableau % 2.16/0.62 # Found 9 steps % 2.16/0.62 cnf(i_0_6, plain, (multiplication(zero,one)=zero), inference(start_rule)). % 2.16/0.62 cnf(i_0_116, plain, (multiplication(zero,one)=zero), inference(extension_rule, [i_0_114])). % 2.16/0.62 cnf(i_0_171, plain, (multiplication(zero,one)!=zero), inference(closure_rule, [i_0_6])). % 2.16/0.62 cnf(i_0_170, plain, (leq(zero,zero)), inference(extension_rule, [i_0_19])). % 2.16/0.62 cnf(i_0_176, plain, (addition(zero,zero)=zero), inference(extension_rule, [i_0_110])). % 2.16/0.62 cnf(i_0_193, plain, (zero!=addition(zero,zero)), inference(closure_rule, [i_0_3])). % 2.16/0.62 cnf(i_0_173, plain, (~leq(multiplication(zero,one),multiplication(zero,one))), inference(extension_rule, [i_0_18])). % 2.16/0.62 cnf(i_0_196, plain, (addition(multiplication(zero,one),multiplication(zero,one))!=multiplication(zero,one)), inference(closure_rule, [i_0_4])). % 2.16/0.62 cnf(i_0_192, plain, (zero=zero), inference(etableau_closure_rule, [i_0_192, ...])). % 2.16/0.62 # End printing tableau % 2.16/0.62 # SZS output end % 2.16/0.62 # Branches closed with saturation will be marked with an "s" % 2.16/0.63 # Child (21721) has found a proof. % 2.16/0.63 % 2.16/0.63 # Proof search is over... % 2.16/0.63 # Freeing feature tree %------------------------------------------------------------------------------