%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS143+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:40 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS143+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/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 05:18: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: 13 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 7 conjectures. % 0.12/0.37 # There are 7 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 # 7 start rule tableaux created. % 0.12/0.37 # 11 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 7 % 0.12/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 15 tableaux to operate on % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # There were 3 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 3 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 3 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.37 cnf(i_0_21, negated_conjecture, (xsd_integer(esk3_0)|cc(esk4_0)|~xsd_string(esk3_0))). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (xsd_string(esk3_0)|cc(esk4_0)|~xsd_integer(esk3_0))). % 0.12/0.37 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.37 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.37 cnf(i_0_12, plain, (rp(X1,esk1_1(X1))|~cc(X1))). % 0.12/0.37 cnf(i_0_13, plain, (X1=X2|~rp(X3,X2)|~rp(X3,X1)|~cc(X3))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (esk6_0!=esk5_0|~rp(esk4_0,X1))). % 0.12/0.37 cnf(i_0_20, negated_conjecture, (xsd_integer(esk3_0)|rp(esk4_0,esk5_0)|~rp(esk4_0,X1))). % 0.12/0.37 cnf(i_0_19, negated_conjecture, (xsd_integer(esk3_0)|rp(esk4_0,esk6_0)|~rp(esk4_0,X1))). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (xsd_string(esk3_0)|rp(esk4_0,esk5_0)|~rp(esk4_0,X1))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (xsd_string(esk3_0)|rp(esk4_0,esk6_0)|~rp(esk4_0,X1))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 6 steps % 0.12/0.37 cnf(i_0_14, negated_conjecture, (esk6_0!=esk5_0|~rp(esk4_0,esk5_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_35, plain, (~rp(esk4_0,esk5_0)), inference(extension_rule, [i_0_16])). % 0.12/0.37 cnf(i_0_682, plain, (xsd_string(esk3_0)), inference(extension_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_34, plain, (esk6_0!=esk5_0), inference(etableau_closure_rule, [i_0_34, ...])). % 0.12/0.37 cnf(i_0_684, plain, (~rp(esk4_0,X2)), inference(etableau_closure_rule, [i_0_684, ...])). % 0.12/0.37 cnf(i_0_694, plain, (~xsd_integer(esk3_0)), inference(etableau_closure_rule, [i_0_694, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (18725) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------