TSTP Solution File: SEU267+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU267+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 02:43:23 EST 2010
% Result : Theorem 84.09s
% Output : Solution 84.57s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17292/SEU267+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t7_mcart_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... d1_mcart_1:
% CSA axiom d1_mcart_1 found
% Looking for CSA axiom ... d2_mcart_1:
% CSA axiom d2_mcart_1 found
% Looking for CSA axiom ... t33_zfmisc_1: CSA axiom t33_zfmisc_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :t33_zfmisc_1:d2_mcart_1:d1_mcart_1 (3)
% Unselected axioms are ... :d1_relat_1:d2_relat_1:antisymmetry_r2_hidden:dt_k5_relat_1:dt_k6_relat_1:dt_k7_relat_1:dt_k8_relat_1:existence_m2_relset_1:fc1_zfmisc_1:rc1_xboole_0:rc2_xboole_0:reflexivity_r1_tarski:t1_xboole_1:t3_ordinal1:t69_enumset1:t7_tarski:t8_zfmisc_1:t9_zfmisc_1:d2_zfmisc_1:t2_tarski:d5_tarski:d10_xboole_0:d4_relat_1:d5_relat_1:t56_relat_1:t8_boole:d10_relat_1:d11_relat_1:d12_relat_1:d13_relat_1:d14_relat_1:d1_wellord1:d4_relat_2:d6_relat_2:d7_relat_1:d8_relat_1:l3_wellord1:commutativity_k2_xboole_0:commutativity_k3_xboole_0:idempotence_k2_xboole_0:idempotence_k3_xboole_0:commutativity_k2_tarski:d4_subset_1:t10_zfmisc_1:d3_relat_1:t22_relset_1:t23_relset_1:t115_relat_1:t30_relat_1:t86_relat_1:d1_relat_2:d1_setfam_1:d8_relat_2:l2_wellord1:t140_relat_1:antisymmetry_r2_xboole_0:dt_k3_subset_1:dt_k4_relat_1:existence_m1_relset_1:existence_m1_subset_1:irreflexivity_r2_xboole_0:symmetry_r1_xboole_0:t6_zfmisc_1:fc10_relat_1:fc1_funct_1:fc2_funct_1:fc4_funct_1:fc5_funct_1:fc9_relat_1:l1_zfmisc_1:t6_boole:fc4_relat_1:fc5_relat_1:fc6_relat_1:fc7_relat_1:fc8_relat_1:l55_zfmisc_1:t106_zfmisc_1:t1_boole:t25_wellord1:t2_boole:t3_boole:t4_boole:cc1_relat_1:fc13_relat_1:rc1_relat_1:rc2_relat_1:t12_xboole_1:t28_xboole_1:t3_xboole_1:t72_funct_1:d1_tarski:d1_xboole_0:d2_tarski:d2_xboole_0:d3_ordinal1:d3_xboole_0:d4_xboole_0:d8_xboole_0:l4_wellord1:t24_ordinal1:d1_enumset1:d4_tarski:t7_boole:involutiveness_k4_relat_1:l82_funct_1:t118_zfmisc_1:t119_zfmisc_1:t143_relat_1:t166_relat_1:t20_relat_1:t64_relat_1:t65_relat_1:d5_subset_1:l1_wellord1:t119_relat_1:t145_relat_1:t146_relat_1:t160_relat_1:t16_wellord1:t17_wellord1:t18_wellord1:t37_relat_1:t74_relat_1:t90_relat_1:t94_relat_1:cc1_funct_1:d12_funct_1:d13_funct_1:d5_funct_1:d8_funct_1:fc1_subset_1:fc1_xboole_0:redefinition_m2_relset_1:t22_funct_1:t23_funct_1:t34_funct_1:t70_funct_1:t8_funct_1:d14_relat_2:d9_relat_2:fc1_ordinal1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:fc4_subset_1:l23_zfmisc_1:l4_zfmisc_1:t21_wellord1:t39_zfmisc_1:t46_zfmisc_1:t65_zfmisc_1:d3_tarski:fc3_funct_1:l29_wellord1:t116_relat_1:t118_relat_1:t144_relat_1:t167_relat_1:t17_xboole_1:t19_wellord1:t19_xboole_1:t1_zfmisc_1:t25_relat_1:t26_xboole_1:t2_xboole_1:t33_xboole_1:t36_xboole_1:t38_zfmisc_1:t44_relat_1:t45_relat_1:t60_relat_1:t63_xboole_1:t7_xboole_1:t8_xboole_1:t99_relat_1:d12_relat_2:d1_ordinal1:d1_zfmisc_1:d4_funct_1:d7_xboole_0:d9_funct_1:dt_k5_setfam_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:fc12_relat_1:l2_zfmisc_1:l32_xboole_1:rc1_subset_1:rc2_subset_1:redefinition_k4_relset_1:redefinition_k5_relset_1:t16_relset_1:t174_relat_1:t1_subset:t21_funct_1:t32_ordinal1:t37_xboole_1:t37_zfmisc_1:t3_subset:t46_relat_1:t47_relat_1:t50_subset_1:t60_xboole_1:t71_relat_1:d1_relset_1:d2_subset_1:d3_wellord1:d6_ordinal1:d6_relat_1:fc11_relat_1:fc1_relat_1:fc2_relat_1:fc3_relat_1:l25_zfmisc_1:l28_zfmisc_1:l3_subset_1:l71_subset_1:rc2_funct_1:t10_ordinal1:t22_wellord1:t23_ordinal1:t23_wellord1:t24_wellord1:t2_subset:t39_xboole_1:t3_xboole_0:t40_xboole_1:t45_xboole_1:t48_xboole_1:t4_subset:t4_xboole_0:t54_funct_1:t68_funct_1:t83_xboole_1:t99_zfmisc_1:d2_ordinal1:d7_wellord1:dt_k2_funct_1:l50_zfmisc_1:rc1_funct_1:rc3_funct_1:rc4_funct_1:t117_relat_1:t31_ordinal1:t31_wellord1:t32_wellord1:t35_funct_1:t43_subset_1:t88_relat_1:t92_zfmisc_1:t9_tarski:d2_wellord1:d6_wellord1:dt_k2_wellord1:t146_funct_1:t147_funct_1:t178_relat_1:t21_relat_1:t57_funct_1:cc2_funct_1:dt_k2_subset_1:rc3_relat_1:redefinition_k6_setfam_1:redefinition_k6_subset_1:t145_funct_1:t14_relset_1:t46_setfam_1:t5_subset:cc1_ordinal1:cc2_ordinal1:d4_ordinal1:dt_k4_relset_1:dt_k5_relset_1:rc1_ordinal1:t12_relset_1:t55_funct_1:connectedness_r1_ordinal1:dt_m2_relset_1:l3_zfmisc_1:redefinition_r1_ordinal1:reflexivity_r1_ordinal1:t20_wellord1:cc1_relset_1:d16_relat_2:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:t136_zfmisc_1:t21_ordinal1:t33_ordinal1:t39_wellord1:t41_ordinal1:t42_ordinal1:t54_subset_1:t5_wellord1:t8_wellord1:d8_setfam_1:fc2_ordinal1:redefinition_k5_setfam_1:t49_wellord1:t54_wellord1:t62_funct_1:cc3_ordinal1:fc3_ordinal1:rc2_ordinal1:rc3_ordinal1:t47_setfam_1:t48_setfam_1:d4_wellord1:d5_wellord1:fc4_ordinal1:t53_wellord1:dt_k10_relat_1:dt_k1_enumset1:dt_k1_funct_1:dt_k1_mcart_1:dt_k1_ordinal1:dt_k1_relat_1:dt_k1_setfam_1:dt_k1_tarski:dt_k1_wellord1:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_mcart_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_k9_relat_1:dt_m1_relset_1:dt_m1_subset_1 (338)
% SZS status THM for /tmp/SystemOnTPTP17292/SEU267+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP17292/SEU267+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 18268
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(?[X2]:?[X3]:X1=ordered_pair(X2,X3)=>![X2]:(X2=pair_second(X1)<=>![X3]:![X4]:(X1=ordered_pair(X3,X4)=>X2=X4))),file('/tmp/SRASS.s.p', d2_mcart_1)).
% fof(3, axiom,![X1]:(?[X2]:?[X3]:X1=ordered_pair(X2,X3)=>![X2]:(X2=pair_first(X1)<=>![X3]:![X4]:(X1=ordered_pair(X3,X4)=>X2=X3))),file('/tmp/SRASS.s.p', d1_mcart_1)).
% fof(4, conjecture,![X1]:![X2]:(pair_first(ordered_pair(X1,X2))=X1&pair_second(ordered_pair(X1,X2))=X2),file('/tmp/SRASS.s.p', t7_mcart_1)).
% fof(5, negated_conjecture,~(![X1]:![X2]:(pair_first(ordered_pair(X1,X2))=X1&pair_second(ordered_pair(X1,X2))=X2)),inference(assume_negation,[status(cth)],[4])).
% fof(11, plain,![X1]:(![X2]:![X3]:~(X1=ordered_pair(X2,X3))|![X2]:((~(X2=pair_second(X1))|![X3]:![X4]:(~(X1=ordered_pair(X3,X4))|X2=X4))&(?[X3]:?[X4]:(X1=ordered_pair(X3,X4)&~(X2=X4))|X2=pair_second(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_second(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X10))&(?[X11]:?[X12]:(X5=ordered_pair(X11,X12)&~(X8=X12))|X8=pair_second(X5)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_second(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X10))&((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))&~(X8=esk2_2(X5,X8)))|X8=pair_second(X5)))),inference(skolemize,[status(esa)],[12])).
% fof(14, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X10)|~(X8=pair_second(X5)))&((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))&~(X8=esk2_2(X5,X8)))|X8=pair_second(X5)))|~(X5=ordered_pair(X6,X7))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X10)|~(X8=pair_second(X5)))|~(X5=ordered_pair(X6,X7)))&(((X5=ordered_pair(esk1_2(X5,X8),esk2_2(X5,X8))|X8=pair_second(X5))|~(X5=ordered_pair(X6,X7)))&((~(X8=esk2_2(X5,X8))|X8=pair_second(X5))|~(X5=ordered_pair(X6,X7))))),inference(distribute,[status(thm)],[14])).
% cnf(18,plain,(X4=X5|X1!=ordered_pair(X2,X3)|X4!=pair_second(X1)|X1!=ordered_pair(X6,X5)),inference(split_conjunct,[status(thm)],[15])).
% fof(19, plain,![X1]:(![X2]:![X3]:~(X1=ordered_pair(X2,X3))|![X2]:((~(X2=pair_first(X1))|![X3]:![X4]:(~(X1=ordered_pair(X3,X4))|X2=X3))&(?[X3]:?[X4]:(X1=ordered_pair(X3,X4)&~(X2=X3))|X2=pair_first(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_first(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X9))&(?[X11]:?[X12]:(X5=ordered_pair(X11,X12)&~(X8=X11))|X8=pair_first(X5)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X5]:(![X6]:![X7]:~(X5=ordered_pair(X6,X7))|![X8]:((~(X8=pair_first(X5))|![X9]:![X10]:(~(X5=ordered_pair(X9,X10))|X8=X9))&((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))&~(X8=esk3_2(X5,X8)))|X8=pair_first(X5)))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X9)|~(X8=pair_first(X5)))&((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))&~(X8=esk3_2(X5,X8)))|X8=pair_first(X5)))|~(X5=ordered_pair(X6,X7))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((((~(X5=ordered_pair(X9,X10))|X8=X9)|~(X8=pair_first(X5)))|~(X5=ordered_pair(X6,X7)))&(((X5=ordered_pair(esk3_2(X5,X8),esk4_2(X5,X8))|X8=pair_first(X5))|~(X5=ordered_pair(X6,X7)))&((~(X8=esk3_2(X5,X8))|X8=pair_first(X5))|~(X5=ordered_pair(X6,X7))))),inference(distribute,[status(thm)],[22])).
% cnf(26,plain,(X4=X5|X1!=ordered_pair(X2,X3)|X4!=pair_first(X1)|X1!=ordered_pair(X5,X6)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, negated_conjecture,?[X1]:?[X2]:(~(pair_first(ordered_pair(X1,X2))=X1)|~(pair_second(ordered_pair(X1,X2))=X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(28, negated_conjecture,?[X3]:?[X4]:(~(pair_first(ordered_pair(X3,X4))=X3)|~(pair_second(ordered_pair(X3,X4))=X4)),inference(variable_rename,[status(thm)],[27])).
% fof(29, negated_conjecture,(~(pair_first(ordered_pair(esk5_0,esk6_0))=esk5_0)|~(pair_second(ordered_pair(esk5_0,esk6_0))=esk6_0)),inference(skolemize,[status(esa)],[28])).
% cnf(30,negated_conjecture,(pair_second(ordered_pair(esk5_0,esk6_0))!=esk6_0|pair_first(ordered_pair(esk5_0,esk6_0))!=esk5_0),inference(split_conjunct,[status(thm)],[29])).
% cnf(35,plain,(X1=X2|ordered_pair(X3,X4)!=ordered_pair(X5,X2)|pair_second(ordered_pair(X5,X2))!=X1),inference(er,[status(thm)],[18,theory(equality)])).
% cnf(36,plain,(X1=X2|ordered_pair(X3,X4)!=ordered_pair(X2,X5)|pair_first(ordered_pair(X2,X5))!=X1),inference(er,[status(thm)],[26,theory(equality)])).
% cnf(39,plain,(pair_second(ordered_pair(X1,X2))=X2|ordered_pair(X3,X4)!=ordered_pair(X1,X2)),inference(er,[status(thm)],[35,theory(equality)])).
% cnf(40,plain,(pair_second(ordered_pair(X1,X2))=X2),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(44,negated_conjecture,($false|pair_first(ordered_pair(esk5_0,esk6_0))!=esk5_0),inference(rw,[status(thm)],[30,40,theory(equality)])).
% cnf(45,negated_conjecture,(pair_first(ordered_pair(esk5_0,esk6_0))!=esk5_0),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(46,plain,(pair_first(ordered_pair(X1,X2))=X1|ordered_pair(X3,X4)!=ordered_pair(X1,X2)),inference(er,[status(thm)],[36,theory(equality)])).
% cnf(67,plain,(pair_first(ordered_pair(X1,X2))=X1),inference(er,[status(thm)],[46,theory(equality)])).
% cnf(74,negated_conjecture,($false),inference(rw,[status(thm)],[45,67,theory(equality)])).
% cnf(75,negated_conjecture,($false),inference(cn,[status(thm)],[74,theory(equality)])).
% cnf(76,negated_conjecture,($false),75,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 33
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 0
% # Paramodulations : 21
% # Factorizations : 0
% # Equation resolutions : 12
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 16
% # ...number of literals in the above : 53
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 14 leaves, 1.79+/-2.042 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 2.33+/-2.560 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP17292/SEU267+2.tptp
%
%------------------------------------------------------------------------------