%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE016+3 : 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 : n022.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:34 EDT 2022 % Result : Theorem 21.13s 3.07s % Output : CNFRefutation 21.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : KLE016+3 : 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.12/0.33 % Computer : n022.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 13:34:32 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.12/0.36 # and selection function SelectCQIPrecW. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 25 Number of unprocessed: 25 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 25 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 13 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 12 extension rule candidate clauses % 0.12/0.37 # 13 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 8 tableaux to operate on % 14.15/2.14 # Creating equality axioms % 14.15/2.14 # Ran out of tableaux, making start rules for all clauses % 21.13/3.07 # There were 2 total branch saturation attempts. % 21.13/3.07 # There were 0 of these attempts blocked. % 21.13/3.07 # There were 0 deferred branch saturation attempts. % 21.13/3.07 # There were 0 free duplicated saturations. % 21.13/3.07 # There were 1 total successful branch saturations. % 21.13/3.07 # There were 0 successful branch saturations in interreduction. % 21.13/3.07 # There were 0 successful branch saturations on the branch. % 21.13/3.07 # There were 1 successful branch saturations after the branch. % 21.13/3.07 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.13/3.07 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.13/3.07 # Begin clausification derivation % 21.13/3.07 % 21.13/3.07 # End clausification derivation % 21.13/3.07 # Begin listing active clauses obtained from FOF to CNF conversion % 21.13/3.07 cnf(i_0_24, negated_conjecture, (test(esk2_0))). % 21.13/3.07 cnf(i_0_25, negated_conjecture, (test(esk3_0))). % 21.13/3.07 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 21.13/3.07 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 21.13/3.07 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 21.13/3.07 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 21.13/3.07 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 21.13/3.07 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 21.13/3.07 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 21.13/3.07 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 21.13/3.07 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 21.13/3.07 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 21.13/3.07 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 21.13/3.07 cnf(i_0_23, negated_conjecture, (~leq(c(multiplication(esk2_0,esk3_0)),addition(c(esk2_0),c(esk3_0)))|~leq(addition(c(esk2_0),c(esk3_0)),c(multiplication(esk2_0,esk3_0))))). % 21.13/3.07 cnf(i_0_22, plain, (c(X1)=zero|test(X1))). % 21.13/3.07 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))). % 21.13/3.07 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 21.13/3.07 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))). % 21.13/3.07 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 21.13/3.07 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))). % 21.13/3.07 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))). % 21.13/3.07 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))). % 21.13/3.07 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))). % 21.13/3.07 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))). % 21.13/3.07 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)). % 21.13/3.07 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 21.13/3.07 # Begin printing tableau % 21.13/3.07 # Found 5 steps % 21.13/3.07 cnf(i_0_25, negated_conjecture, (test(esk3_0)), inference(start_rule)). % 21.13/3.07 cnf(i_0_29, plain, (test(esk3_0)), inference(extension_rule, [i_0_21])). % 21.13/3.07 cnf(i_0_104, plain, (complement(esk3_0,c(esk3_0))), inference(extension_rule, [i_0_14])). % 21.13/3.07 cnf(i_0_141, plain, (test(c(esk3_0))), inference(extension_rule, [i_0_15])). % 21.13/3.07 cnf(i_0_126469, plain, (complement(esk1_1(c(esk3_0)),c(esk3_0))), inference(etableau_closure_rule, [i_0_126469, ...])). % 21.13/3.07 # End printing tableau % 21.13/3.07 # SZS output end % 21.13/3.07 # Branches closed with saturation will be marked with an "s" % 21.13/3.08 # Child (26990) has found a proof. % 21.13/3.08 % 21.13/3.08 # Proof search is over... % 21.13/3.08 # Freeing feature tree %------------------------------------------------------------------------------