%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS145+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 : n020.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.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 : KRS145+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.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 13:48:36 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.20/0.37 # and selection function SelectNewComplexAHP. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 21 Number of unprocessed: 21 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 21 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 14 conjectures. % 0.20/0.37 # There are 14 start rule candidates: % 0.20/0.37 # Found 1 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 14 start rule tableaux created. % 0.20/0.37 # 20 extension rule candidate clauses % 0.20/0.37 # 1 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There were 6 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 6 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 6 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/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_29, negated_conjecture, (xsd_integer(esk4_0)|cc(esk5_0)|~xsd_string(esk4_0))). % 0.20/0.39 cnf(i_0_22, negated_conjecture, (xsd_string(esk4_0)|cc(esk5_0)|~xsd_integer(esk4_0))). % 0.20/0.39 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.20/0.39 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.20/0.39 cnf(i_0_12, plain, (esk2_1(X1)!=esk1_1(X1)|~cc(X1))). % 0.20/0.39 cnf(i_0_14, plain, (rp(X1,esk1_1(X1))|~cc(X1))). % 0.20/0.39 cnf(i_0_13, plain, (rp(X1,esk2_1(X1))|~cc(X1))). % 0.20/0.39 cnf(i_0_25, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|esk7_0!=esk6_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_24, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|esk8_0!=esk6_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_23, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|esk8_0!=esk7_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_18, negated_conjecture, (X1=X2|xsd_string(esk4_0)|esk7_0!=esk6_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_17, negated_conjecture, (X1=X2|xsd_string(esk4_0)|esk8_0!=esk6_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_16, negated_conjecture, (X1=X2|xsd_string(esk4_0)|esk8_0!=esk7_0|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_28, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|rp(esk5_0,esk6_0)|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_27, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|rp(esk5_0,esk7_0)|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_26, negated_conjecture, (X1=X2|xsd_integer(esk4_0)|rp(esk5_0,esk8_0)|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_21, negated_conjecture, (X1=X2|xsd_string(esk4_0)|rp(esk5_0,esk6_0)|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_15, plain, (X1=X2|X1=X3|X2=X3|~rp(X4,X3)|~rp(X4,X2)|~rp(X4,X1)|~cc(X4))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (X1=X2|xsd_string(esk4_0)|rp(esk5_0,esk7_0)|~rp(esk5_0,X2)|~rp(esk5_0,X1))). % 0.20/0.39 cnf(i_0_19, negated_conjecture, (X1=X2|xsd_string(esk4_0)|rp(esk5_0,esk8_0)|~rp(esk5_0,X2)|~rp(esk5_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 9 steps % 0.20/0.39 cnf(i_0_17, negated_conjecture, (esk2_1(esk5_0)=esk1_1(esk5_0)|xsd_string(esk4_0)|esk8_0!=esk6_0|~rp(esk5_0,esk1_1(esk5_0))|~rp(esk5_0,esk2_1(esk5_0))), inference(start_rule)). % 0.20/0.39 cnf(i_0_65, plain, (esk2_1(esk5_0)=esk1_1(esk5_0)), inference(extension_rule, [i_0_12])). % 0.20/0.39 cnf(i_0_101, plain, (~cc(esk5_0)), inference(extension_rule, [i_0_22])). % 0.20/0.39 cnf(i_0_66, plain, (xsd_string(esk4_0)), inference(etableau_closure_rule, [i_0_66, ...])). % 0.20/0.39 cnf(i_0_67, plain, (esk8_0!=esk6_0), inference(etableau_closure_rule, [i_0_67, ...])). % 0.20/0.39 cnf(i_0_68, plain, (~rp(esk5_0,esk1_1(esk5_0))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.20/0.39 cnf(i_0_69, plain, (~rp(esk5_0,esk2_1(esk5_0))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.20/0.39 cnf(i_0_177, plain, (xsd_string(esk4_0)), inference(etableau_closure_rule, [i_0_177, ...])). % 0.20/0.39 cnf(i_0_179, plain, (~xsd_integer(esk4_0)), inference(etableau_closure_rule, [i_0_179, ...])). % 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 (18618) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------