%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE009+4 : 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 : n021.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:30 EDT 2022 % Result : Theorem 2.01s 0.63s % Output : CNFRefutation 2.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : KLE009+4 : TPTP v8.1.0. Released v4.0.0. % 0.09/0.15 % 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 : n021.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 15:55:30 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN % 0.14/0.39 # and selection function PSelectSmallestOrientable. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 27 Number of unprocessed: 27 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.40 # The folding up rule is enabled... % 0.14/0.40 # Local unification is enabled... % 0.14/0.40 # Any saturation attempts will use folding labels... % 0.14/0.40 # 27 beginning clauses after preprocessing and clausification % 0.14/0.40 # Creating start rules for all 3 conjectures. % 0.14/0.40 # There are 3 start rule candidates: % 0.14/0.40 # Found 13 unit axioms. % 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.40 # 3 start rule tableaux created. % 0.14/0.40 # 14 extension rule candidate clauses % 0.14/0.40 # 13 unit axiom clauses % 0.14/0.40 % 0.14/0.40 # Requested 8, 32 cores available to the main process. % 0.14/0.40 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.40 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.14/0.40 # We now have 10 tableaux to operate on % 2.01/0.63 # There were 2 total branch saturation attempts. % 2.01/0.63 # There were 0 of these attempts blocked. % 2.01/0.63 # There were 0 deferred branch saturation attempts. % 2.01/0.63 # There were 0 free duplicated saturations. % 2.01/0.63 # There were 2 total successful branch saturations. % 2.01/0.63 # There were 0 successful branch saturations in interreduction. % 2.01/0.63 # There were 0 successful branch saturations on the branch. % 2.01/0.63 # There were 2 successful branch saturations after the branch. % 2.01/0.63 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.01/0.63 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.01/0.63 # Begin clausification derivation % 2.01/0.63 % 2.01/0.63 # End clausification derivation % 2.01/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 2.01/0.63 cnf(i_0_26, negated_conjecture, (test(esk2_0))). % 2.01/0.63 cnf(i_0_27, negated_conjecture, (test(esk3_0))). % 2.01/0.63 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 2.01/0.63 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 2.01/0.63 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 2.01/0.63 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 2.01/0.63 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 2.01/0.63 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 2.01/0.63 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 2.01/0.63 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 2.01/0.63 cnf(i_0_8, plain, (multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)))). % 2.01/0.63 cnf(i_0_9, plain, (multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)))). % 2.01/0.63 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 2.01/0.63 cnf(i_0_22, plain, (c(X1)=zero|test(X1))). % 2.01/0.63 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))). % 2.01/0.63 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 2.01/0.63 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))). % 2.01/0.63 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 2.01/0.63 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))). % 2.01/0.63 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))). % 2.01/0.63 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))). % 2.01/0.63 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))). % 2.01/0.63 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))). % 2.01/0.63 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)). % 2.01/0.63 cnf(i_0_25, negated_conjecture, (~leq(one,addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,c(esk3_0)),multiplication(c(esk2_0),c(esk3_0))))))|~leq(addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,c(esk3_0)),multiplication(c(esk2_0),c(esk3_0))))),one))). % 2.01/0.63 cnf(i_0_23, plain, (c(addition(X1,X2))=multiplication(c(X1),c(X2))|~test(X2)|~test(X1))). % 2.01/0.63 cnf(i_0_24, plain, (c(multiplication(X1,X2))=addition(c(X1),c(X2))|~test(X2)|~test(X1))). % 2.01/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.01/0.63 # Begin printing tableau % 2.01/0.63 # Found 7 steps % 2.01/0.63 cnf(i_0_27, negated_conjecture, (test(esk3_0)), inference(start_rule)). % 2.01/0.63 cnf(i_0_31, plain, (test(esk3_0)), inference(extension_rule, [i_0_20])). % 2.01/0.63 cnf(i_0_118, plain, (~complement(esk3_0,zero)), inference(extension_rule, [i_0_16])). % 2.01/0.63 cnf(i_0_196, plain, (multiplication(esk3_0,zero)!=zero), inference(closure_rule, [i_0_10])). % 2.01/0.63 cnf(i_0_197, plain, (multiplication(zero,esk3_0)!=zero), inference(closure_rule, [i_0_11])). % 2.01/0.63 cnf(i_0_117, plain, (c(esk3_0)=zero), inference(etableau_closure_rule, [i_0_117, ...])). % 2.01/0.63 cnf(i_0_195, plain, (addition(zero,esk3_0)!=one), inference(etableau_closure_rule, [i_0_195, ...])). % 2.01/0.63 # End printing tableau % 2.01/0.63 # SZS output end % 2.01/0.63 # Branches closed with saturation will be marked with an "s" % 2.03/0.64 # Child (21103) has found a proof. % 2.03/0.64 % 2.03/0.64 # Proof search is over... % 2.03/0.64 # Freeing feature tree %------------------------------------------------------------------------------