%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS138+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 : n023.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.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS138+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n023.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jun 7 10:57:53 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 26 Number of unprocessed: 26 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 26 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 16 conjectures. % 0.14/0.37 # There are 16 start rule candidates: % 0.14/0.37 # Found 5 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 16 start rule tableaux created. % 0.14/0.37 # 21 extension rule candidate clauses % 0.14/0.37 # 5 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There were 4 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 4 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 4 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_20, plain, (requalityOnA(ib,ib))). % 0.20/0.40 cnf(i_0_18, plain, (requalityOnA(ia,ia))). % 0.20/0.40 cnf(i_0_13, plain, (cA(ib))). % 0.20/0.40 cnf(i_0_12, plain, (cA(ia))). % 0.20/0.40 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.20/0.40 cnf(i_0_32, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ib|~xsd_string(esk2_0)|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_34, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ia|~xsd_string(esk2_0)|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.20/0.40 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.20/0.40 cnf(i_0_14, plain, (X1=ia|X1=ib|~cA(X1))). % 0.20/0.40 cnf(i_0_30, negated_conjecture, (xsd_integer(esk2_0)|esk3_0!=ic|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_24, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ib|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_26, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ia|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|esk3_0!=ic|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_16, plain, (cA(X1)|~requalityOnA(X2,X1))). % 0.20/0.40 cnf(i_0_33, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ib)). % 0.20/0.40 cnf(i_0_15, plain, (X1=X2|~requalityOnA(X2,X3)|~requalityOnA(X1,X3))). % 0.20/0.40 cnf(i_0_35, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ia)). % 0.20/0.40 cnf(i_0_31, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ic)). % 0.20/0.40 cnf(i_0_25, negated_conjecture, (xsd_string(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ib)). % 0.20/0.40 cnf(i_0_27, negated_conjecture, (xsd_string(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ia)). % 0.20/0.40 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|requalityOnA(esk5_0,esk6_0)|esk3_0!=ic)). % 0.20/0.40 cnf(i_0_36, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk3_0,esk4_0)|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_28, negated_conjecture, (xsd_string(esk2_0)|requalityOnA(esk3_0,esk4_0)|~requalityOnA(esk6_0,esk5_0))). % 0.20/0.40 cnf(i_0_37, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk5_0,esk6_0)|requalityOnA(esk3_0,esk4_0))). % 0.20/0.40 cnf(i_0_29, negated_conjecture, (xsd_string(esk2_0)|requalityOnA(esk5_0,esk6_0)|requalityOnA(esk3_0,esk4_0))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 7 steps % 0.20/0.40 cnf(i_0_37, negated_conjecture, (xsd_integer(esk2_0)|requalityOnA(esk5_0,esk6_0)|requalityOnA(esk3_0,esk4_0)), inference(start_rule)). % 0.20/0.40 cnf(i_0_43, plain, (xsd_integer(esk2_0)), inference(extension_rule, [i_0_11])). % 0.20/0.40 cnf(i_0_90, plain, (~xsd_string(esk2_0)), inference(extension_rule, [i_0_29])). % 0.20/0.40 cnf(i_0_44, plain, (requalityOnA(esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_44, ...])). % 0.20/0.40 cnf(i_0_45, plain, (requalityOnA(esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_45, ...])). % 0.20/0.40 cnf(i_0_103, plain, (requalityOnA(esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_103, ...])). % 0.20/0.41 cnf(i_0_104, plain, (requalityOnA(esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_104, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Child (8020) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------