%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS142+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 : 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 03:00:39 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.03/0.12 % Problem : KRS142+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/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.34 % Computer : n022.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 7 06:51:05 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.20/0.38 # and selection function SelectNewComplexAHP. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 21 Number of unprocessed: 21 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 21 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 16 conjectures. % 0.20/0.38 # There are 16 start rule candidates: % 0.20/0.38 # Found 1 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 16 start rule tableaux created. % 0.20/0.38 # 20 extension rule candidate clauses % 0.20/0.38 # 1 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There were 4 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 4 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 4 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/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_8, plain, (~cowlNothing(X1))). % 0.20/0.39 cnf(i_0_26, negated_conjecture, (xsd_integer(esk3_0)|cc(esk4_0)|esk7_0!=esk6_0|~xsd_string(esk3_0))). % 0.20/0.39 cnf(i_0_18, negated_conjecture, (xsd_string(esk3_0)|cc(esk4_0)|esk7_0!=esk6_0|~xsd_integer(esk3_0))). % 0.20/0.39 cnf(i_0_29, negated_conjecture, (xsd_integer(esk3_0)|cc(esk5_0)|cc(esk4_0)|~xsd_string(esk3_0))). % 0.20/0.39 cnf(i_0_21, negated_conjecture, (xsd_string(esk3_0)|cc(esk5_0)|cc(esk4_0)|~xsd_integer(esk3_0))). % 0.20/0.39 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.20/0.39 cnf(i_0_13, plain, (rp(X1,esk1_1(X1))|~cc(X1))). % 0.20/0.39 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.20/0.39 cnf(i_0_12, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc(X3))). % 0.20/0.39 cnf(i_0_22, negated_conjecture, (xsd_integer(esk3_0)|esk7_0!=esk6_0|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_14, negated_conjecture, (xsd_string(esk3_0)|esk7_0!=esk6_0|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_28, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk6_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_27, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk7_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk6_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_19, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk7_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_25, negated_conjecture, (xsd_integer(esk3_0)|cc(esk5_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_17, negated_conjecture, (xsd_string(esk3_0)|cc(esk5_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_24, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk6_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_23, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk7_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_16, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk6_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_15, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk7_0)|~rp(esk4_0,X1))). % 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 7 steps % 0.20/0.39 cnf(i_0_19, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk7_0)|cc(esk4_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_48, plain, (xsd_string(esk3_0)), inference(extension_rule, [i_0_11])). % 0.20/0.39 cnf(i_0_87, plain, (~xsd_integer(esk3_0)), inference(extension_rule, [i_0_23])). % 0.20/0.39 cnf(i_0_49, plain, (rp(esk5_0,esk7_0)), inference(etableau_closure_rule, [i_0_49, ...])). % 0.20/0.39 cnf(i_0_50, plain, (cc(esk4_0)), inference(etableau_closure_rule, [i_0_50, ...])). % 0.20/0.39 cnf(i_0_103, plain, (rp(esk5_0,esk7_0)), inference(etableau_closure_rule, [i_0_103, ...])). % 0.20/0.39 cnf(i_0_104, plain, (~rp(esk4_0,X2)), inference(etableau_closure_rule, [i_0_104, ...])). % 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 4 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 4 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 4 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/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_8, plain, (~cowlNothing(X1))). % 0.20/0.39 cnf(i_0_26, negated_conjecture, (xsd_integer(esk3_0)|cc(esk4_0)|esk7_0!=esk6_0|~xsd_string(esk3_0))). % 0.20/0.39 cnf(i_0_18, negated_conjecture, (xsd_string(esk3_0)|cc(esk4_0)|esk7_0!=esk6_0|~xsd_integer(esk3_0))). % 0.20/0.39 cnf(i_0_29, negated_conjecture, (xsd_integer(esk3_0)|cc(esk5_0)|cc(esk4_0)|~xsd_string(esk3_0))). % 0.20/0.39 cnf(i_0_21, negated_conjecture, (xsd_string(esk3_0)|cc(esk5_0)|cc(esk4_0)|~xsd_integer(esk3_0))). % 0.20/0.39 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.20/0.39 cnf(i_0_13, plain, (rp(X1,esk1_1(X1))|~cc(X1))). % 0.20/0.39 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.20/0.39 cnf(i_0_12, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc(X3))). % 0.20/0.39 cnf(i_0_22, negated_conjecture, (xsd_integer(esk3_0)|esk7_0!=esk6_0|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_14, negated_conjecture, (xsd_string(esk3_0)|esk7_0!=esk6_0|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_28, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk6_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_27, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk7_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk6_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_19, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk7_0)|cc(esk4_0))). % 0.20/0.39 cnf(i_0_25, negated_conjecture, (xsd_integer(esk3_0)|cc(esk5_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_17, negated_conjecture, (xsd_string(esk3_0)|cc(esk5_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_24, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk6_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_23, negated_conjecture, (xsd_integer(esk3_0)|rp(esk5_0,esk7_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_16, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk6_0)|~rp(esk4_0,X1))). % 0.20/0.39 cnf(i_0_15, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk7_0)|~rp(esk4_0,X1))). % 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 7 steps % 0.20/0.39 cnf(i_0_20, negated_conjecture, (xsd_string(esk3_0)|rp(esk5_0,esk6_0)|cc(esk4_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_51, plain, (xsd_string(esk3_0)), inference(extension_rule, [i_0_11])). % 0.20/0.39 cnf(i_0_87, plain, (~xsd_integer(esk3_0)), inference(extension_rule, [i_0_23])). % 0.20/0.39 cnf(i_0_52, plain, (rp(esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_52, ...])). % 0.20/0.39 cnf(i_0_53, plain, (cc(esk4_0)), inference(etableau_closure_rule, [i_0_53, ...])). % 0.20/0.39 cnf(i_0_103, plain, (rp(esk5_0,esk7_0)), inference(etableau_closure_rule, [i_0_103, ...])). % 0.20/0.39 cnf(i_0_104, plain, (~rp(esk4_0,X2)), inference(etableau_closure_rule, [i_0_104, ...])). % 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 # Child (32266) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------