TSTP Solution File: SEU252+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU252+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:28:17 EST 2010
% Result : Theorem 96.18s
% Output : Solution 96.47s
% 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/SystemOnTPTP15081/SEU252+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t22_wellord1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k2_wellord1:
% CSA axiom dt_k2_wellord1 found
% Looking for CSA axiom ... antisymmetry_r2_hidden: CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... commutativity_k3_xboole_0:
% CSA axiom commutativity_k3_xboole_0 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... idempotence_k3_xboole_0:
% CSA axiom idempotence_k3_xboole_0 found
% Looking for CSA axiom ... t16_wellord1:
% CSA axiom t16_wellord1 found
% Looking for CSA axiom ... t19_wellord1:
% CSA axiom t19_wellord1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% CSA axiom rc1_funct_1 found
% Looking for CSA axiom ... d6_wellord1: CSA axiom d6_wellord1 found
% Looking for CSA axiom ... l1_wellord1:
% CSA axiom l1_wellord1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... existence_m1_subset_1:
% CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... rc1_xboole_0:
% CSA axiom rc1_xboole_0 found
% Looking for CSA axiom ... rc2_funct_1:
% CSA axiom rc2_funct_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... t106_zfmisc_1:
% CSA axiom t106_zfmisc_1 found
% Looking for CSA axiom ... rc3_funct_1:
% CSA axiom rc3_funct_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :rc3_funct_1:t106_zfmisc_1:rc2_xboole_0:rc2_funct_1:rc1_xboole_0:existence_m1_subset_1:l1_wellord1:d6_wellord1:rc1_funct_1:t19_wellord1:t16_wellord1:idempotence_k3_xboole_0:commutativity_k3_xboole_0:antisymmetry_r2_hidden:dt_k2_wellord1 (15)
% Unselected axioms are ... :t2_boole:cc1_funct_1:fc1_zfmisc_1:t7_boole:cc2_funct_1:t8_boole:commutativity_k2_xboole_0:idempotence_k2_xboole_0:t1_subset:commutativity_k2_tarski:t1_boole:t2_subset:d5_tarski:d6_relat_1:t6_boole:fc1_xboole_0:fc2_xboole_0:fc3_xboole_0:dt_k1_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_xboole_0:dt_k4_tarski:dt_m1_subset_1 (29)
% SZS status THM for /tmp/SystemOnTPTP15081/SEU252+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP15081/SEU252+1.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 17697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(7, axiom,![X1]:(relation(X1)=>(reflexive(X1)<=>![X2]:(in(X2,relation_field(X1))=>in(ordered_pair(X2,X2),X1)))),file('/tmp/SRASS.s.p', l1_wellord1)).
% fof(10, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_field(relation_restriction(X3,X2)))=>(in(X1,relation_field(X3))&in(X1,X2)))),file('/tmp/SRASS.s.p', t19_wellord1)).
% fof(11, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_restriction(X3,X2))<=>(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))),file('/tmp/SRASS.s.p', t16_wellord1)).
% fof(15, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k2_wellord1)).
% fof(16, conjecture,![X1]:![X2]:(relation(X2)=>(reflexive(X2)=>reflexive(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t22_wellord1)).
% fof(17, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(reflexive(X2)=>reflexive(relation_restriction(X2,X1))))),inference(assume_negation,[status(cth)],[16])).
% fof(25, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(45, plain,![X1]:(~(relation(X1))|((~(reflexive(X1))|![X2]:(~(in(X2,relation_field(X1)))|in(ordered_pair(X2,X2),X1)))&(?[X2]:(in(X2,relation_field(X1))&~(in(ordered_pair(X2,X2),X1)))|reflexive(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(46, plain,![X3]:(~(relation(X3))|((~(reflexive(X3))|![X4]:(~(in(X4,relation_field(X3)))|in(ordered_pair(X4,X4),X3)))&(?[X5]:(in(X5,relation_field(X3))&~(in(ordered_pair(X5,X5),X3)))|reflexive(X3)))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X3]:(~(relation(X3))|((~(reflexive(X3))|![X4]:(~(in(X4,relation_field(X3)))|in(ordered_pair(X4,X4),X3)))&((in(esk6_1(X3),relation_field(X3))&~(in(ordered_pair(esk6_1(X3),esk6_1(X3)),X3)))|reflexive(X3)))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X3]:![X4]:((((~(in(X4,relation_field(X3)))|in(ordered_pair(X4,X4),X3))|~(reflexive(X3)))&((in(esk6_1(X3),relation_field(X3))&~(in(ordered_pair(esk6_1(X3),esk6_1(X3)),X3)))|reflexive(X3)))|~(relation(X3))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:((((~(in(X4,relation_field(X3)))|in(ordered_pair(X4,X4),X3))|~(reflexive(X3)))|~(relation(X3)))&(((in(esk6_1(X3),relation_field(X3))|reflexive(X3))|~(relation(X3)))&((~(in(ordered_pair(esk6_1(X3),esk6_1(X3)),X3))|reflexive(X3))|~(relation(X3))))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(reflexive(X1)|~relation(X1)|~in(ordered_pair(esk6_1(X1),esk6_1(X1)),X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(reflexive(X1)|in(esk6_1(X1),relation_field(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(in(ordered_pair(X2,X2),X1)|~relation(X1)|~reflexive(X1)|~in(X2,relation_field(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(61, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(X1,relation_field(relation_restriction(X3,X2))))|(in(X1,relation_field(X3))&in(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(62, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(X4,relation_field(relation_restriction(X6,X5))))|(in(X4,relation_field(X6))&in(X4,X5)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X4]:![X5]:![X6]:(((in(X4,relation_field(X6))|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))&((in(X4,X5)|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))),inference(distribute,[status(thm)],[62])).
% cnf(64,plain,(in(X2,X3)|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,plain,(in(X2,relation_field(X1))|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[63])).
% fof(66, plain,![X1]:![X2]:![X3]:(~(relation(X3))|((~(in(X1,relation_restriction(X3,X2)))|(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))&((~(in(X1,X3))|~(in(X1,cartesian_product2(X2,X2))))|in(X1,relation_restriction(X3,X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(67, plain,![X4]:![X5]:![X6]:(~(relation(X6))|((~(in(X4,relation_restriction(X6,X5)))|(in(X4,X6)&in(X4,cartesian_product2(X5,X5))))&((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5))))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:((((in(X4,X6)|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6)))&((in(X4,cartesian_product2(X5,X5))|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6))))&(((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5)))|~(relation(X6)))),inference(distribute,[status(thm)],[67])).
% cnf(69,plain,(in(X2,relation_restriction(X1,X3))|~relation(X1)|~in(X2,cartesian_product2(X3,X3))|~in(X2,X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(79, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(80, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_restriction(X3,X4))),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(relation(relation_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(82, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(reflexive(X2)&~(reflexive(relation_restriction(X2,X1))))),inference(fof_nnf,[status(thm)],[17])).
% fof(83, negated_conjecture,?[X3]:?[X4]:(relation(X4)&(reflexive(X4)&~(reflexive(relation_restriction(X4,X3))))),inference(variable_rename,[status(thm)],[82])).
% fof(84, negated_conjecture,(relation(esk9_0)&(reflexive(esk9_0)&~(reflexive(relation_restriction(esk9_0,esk8_0))))),inference(skolemize,[status(esa)],[83])).
% cnf(85,negated_conjecture,(~reflexive(relation_restriction(esk9_0,esk8_0))),inference(split_conjunct,[status(thm)],[84])).
% cnf(86,negated_conjecture,(reflexive(esk9_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(96,plain,(in(esk6_1(relation_restriction(X1,X2)),X2)|reflexive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[64,51,theory(equality)])).
% cnf(97,plain,(in(esk6_1(relation_restriction(X1,X2)),relation_field(X1))|reflexive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[65,51,theory(equality)])).
% cnf(111,plain,(in(ordered_pair(X1,X2),relation_restriction(X3,X4))|~in(ordered_pair(X1,X2),X3)|~relation(X3)|~in(X2,X4)|~in(X1,X4)),inference(spm,[status(thm)],[69,28,theory(equality)])).
% cnf(126,plain,(reflexive(relation_restriction(X1,X2))|in(esk6_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(csr,[status(thm)],[96,81])).
% cnf(156,plain,(reflexive(relation_restriction(X1,X2))|in(esk6_1(relation_restriction(X1,X2)),relation_field(X1))|~relation(X1)),inference(csr,[status(thm)],[97,81])).
% cnf(525,plain,(reflexive(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~in(esk6_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(spm,[status(thm)],[50,111,theory(equality)])).
% cnf(2247,plain,(reflexive(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~relation(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[525,126])).
% cnf(2248,plain,(reflexive(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~relation(X1)),inference(csr,[status(thm)],[2247,81])).
% cnf(2258,plain,(reflexive(relation_restriction(X1,X2))|~relation(X1)|~reflexive(X1)|~in(esk6_1(relation_restriction(X1,X2)),relation_field(X1))),inference(spm,[status(thm)],[2248,52,theory(equality)])).
% cnf(2264,plain,(reflexive(relation_restriction(X1,X2))|~reflexive(X1)|~relation(X1)),inference(csr,[status(thm)],[2258,156])).
% cnf(2265,negated_conjecture,(~reflexive(esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[85,2264,theory(equality)])).
% cnf(2269,negated_conjecture,($false|~relation(esk9_0)),inference(rw,[status(thm)],[2265,86,theory(equality)])).
% cnf(2270,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2269,87,theory(equality)])).
% cnf(2271,negated_conjecture,($false),inference(cn,[status(thm)],[2270,theory(equality)])).
% cnf(2272,negated_conjecture,($false),2271,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 394
% # ...of these trivial : 0
% # ...subsumed : 162
% # ...remaining for further processing: 232
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 0
% # Generated clauses : 2024
% # ...of the previous two non-trivial : 1985
% # Contextual simplify-reflections : 155
% # Paramodulations : 2024
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 1581
% # ...number of literals in the above : 9743
% # Clause-clause subsumption calls (NU) : 9934
% # Rec. Clause-clause subsumption calls : 3952
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 143 leaves, 3.75+/-5.532 terms/leaf
% # Paramod-from index: 30 leaves, 2.87+/-5.864 terms/leaf
% # Paramod-into index: 114 leaves, 3.42+/-5.496 terms/leaf
% # -------------------------------------------------
% # User time : 0.164 s
% # System time : 0.007 s
% # Total time : 0.171 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.29 CPU 0.37 WC
% FINAL PrfWatch: 0.29 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP15081/SEU252+1.tptp
%
%------------------------------------------------------------------------------