%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS167+1 : TPTP v8.1.0. Released v3.1.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 03:00:44 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : KRS167+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/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 : n021.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 : Tue Jun 7 07:05:21 EDT 2022 % 0.12/0.33 % 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_S5PRR_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 17 Number of unprocessed: 17 % 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 # 17 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 4 conjectures. % 0.12/0.37 # There are 4 start rule candidates: % 0.12/0.37 # Found 1 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 4 start rule tableaux created. % 0.12/0.37 # 16 extension rule candidate clauses % 0.12/0.37 # 1 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 4 % 0.12/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 10 tableaux to operate on % 0.12/0.38 # There were 5 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 5 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 5 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_9, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk8_0)|~xsd_string(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_string(esk8_0)|~xsd_integer(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_string(esk8_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_integer(esk8_0))). % 0.12/0.38 cnf(i_0_11, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_17, plain, (rp(X1,esk1_1(X1))|~cc1(X1))). % 0.12/0.38 cnf(i_0_12, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (cc1(X1)|esk3_1(X1)!=esk2_1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_18, plain, (cc2(X1)|esk6_1(X1)!=esk5_1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_22, plain, (rp(X1,esk4_1(X1))|~cc2(X1))). % 0.12/0.38 cnf(i_0_15, plain, (rp(X1,esk2_1(X1))|cc1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_16, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc1(X3))). % 0.12/0.38 cnf(i_0_21, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc2(X3))). % 0.12/0.38 cnf(i_0_14, plain, (rp(X1,esk3_1(X1))|cc1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_20, plain, (rp(X1,esk5_1(X1))|cc2(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_19, plain, (rp(X1,esk6_1(X1))|cc2(X1)|~rp(X1,X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_integer(esk8_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_28, plain, (cc2(esk9_0)), inference(extension_rule, [i_0_22])). % 0.12/0.38 cnf(i_0_105, plain, (rp(esk9_0,esk4_1(esk9_0))), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_27, plain, (xsd_string(esk8_0)), inference(etableau_closure_rule, [i_0_27, ...])). % 0.12/0.38 cnf(i_0_29, plain, (cc1(esk9_0)), inference(etableau_closure_rule, [i_0_29, ...])). % 0.12/0.38 cnf(i_0_30, plain, (~xsd_integer(esk8_0)), inference(etableau_closure_rule, [i_0_30, ...])). % 0.12/0.38 cnf(i_0_449, plain, (cc1(esk9_0)), inference(etableau_closure_rule, [i_0_449, ...])). % 0.12/0.38 cnf(i_0_450, plain, (esk3_1(esk9_0)!=esk2_1(esk9_0)), inference(etableau_closure_rule, [i_0_450, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 5 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 5 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 5 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_9, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk8_0)|~xsd_string(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_string(esk8_0)|~xsd_integer(esk8_0)|~cc2(esk9_0)|~cc1(esk9_0))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_string(esk8_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_integer(esk8_0))). % 0.12/0.38 cnf(i_0_11, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_17, plain, (rp(X1,esk1_1(X1))|~cc1(X1))). % 0.12/0.38 cnf(i_0_12, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (cc1(X1)|esk3_1(X1)!=esk2_1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_18, plain, (cc2(X1)|esk6_1(X1)!=esk5_1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_22, plain, (rp(X1,esk4_1(X1))|~cc2(X1))). % 0.12/0.38 cnf(i_0_15, plain, (rp(X1,esk2_1(X1))|cc1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_16, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc1(X3))). % 0.12/0.38 cnf(i_0_21, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc2(X3))). % 0.12/0.38 cnf(i_0_14, plain, (rp(X1,esk3_1(X1))|cc1(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_20, plain, (rp(X1,esk5_1(X1))|cc2(X1)|~rp(X1,X2))). % 0.12/0.38 cnf(i_0_19, plain, (rp(X1,esk6_1(X1))|cc2(X1)|~rp(X1,X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk8_0)|cc2(esk9_0)|cc1(esk9_0)|~xsd_string(esk8_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_32, plain, (cc2(esk9_0)), inference(extension_rule, [i_0_22])). % 0.12/0.38 cnf(i_0_305, plain, (rp(esk9_0,esk4_1(esk9_0))), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_31, plain, (xsd_integer(esk8_0)), inference(etableau_closure_rule, [i_0_31, ...])). % 0.12/0.38 cnf(i_0_33, plain, (cc1(esk9_0)), inference(etableau_closure_rule, [i_0_33, ...])). % 0.12/0.38 cnf(i_0_34, plain, (~xsd_string(esk8_0)), inference(etableau_closure_rule, [i_0_34, ...])). % 0.12/0.38 cnf(i_0_399, plain, (cc1(esk9_0)), inference(etableau_closure_rule, [i_0_399, ...])). % 0.12/0.38 cnf(i_0_400, plain, (esk3_1(esk9_0)!=esk2_1(esk9_0)), inference(etableau_closure_rule, [i_0_400, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (8077) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------