TSTP Solution File: SEU251+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU251+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 : art04.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:03 EST 2010
% Result : Theorem 88.51s
% Output : Solution 89.43s
% 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/SystemOnTPTP12771/SEU251+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t21_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 ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... d3_tarski:
% CSA axiom d3_tarski found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... t16_wellord1:
% CSA axiom t16_wellord1 found
% Looking for CSA axiom ... rc1_funct_1: CSA axiom rc1_funct_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... d1_wellord1:
% CSA axiom d1_wellord1 found
% Looking for CSA axiom ... d6_wellord1:
% CSA axiom d6_wellord1 found
% Looking for CSA axiom ... rc2_funct_1:
% CSA axiom rc2_funct_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :rc2_funct_1:d6_wellord1:d1_wellord1:rc1_funct_1:t16_wellord1:antisymmetry_r2_hidden:d3_tarski:reflexivity_r1_tarski:dt_k2_wellord1 (9)
% Unselected axioms are ... :t3_subset:existence_m1_subset_1:rc1_xboole_0:rc2_xboole_0:rc3_funct_1:t2_boole:fc1_zfmisc_1:cc1_funct_1:t7_boole:t8_boole:cc2_funct_1:t1_subset:commutativity_k3_xboole_0:d5_tarski:idempotence_k3_xboole_0:commutativity_k2_tarski:fc1_xboole_0:t2_subset:t4_subset:t5_subset:t6_boole:dt_k1_tarski:dt_k1_wellord1:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_tarski:dt_k2_zfmisc_1:dt_k3_xboole_0:dt_k4_tarski:dt_m1_subset_1 (30)
% SZS status THM for /tmp/SystemOnTPTP12771/SEU251+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP12771/SEU251+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 14513
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(relation(X1)=>![X2]:![X3]:(X3=fiber(X1,X2)<=>![X4]:(in(X4,X3)<=>(~(X4=X2)&in(ordered_pair(X4,X2),X1))))),file('/tmp/SRASS.s.p', d1_wellord1)).
% fof(5, 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(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(9, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k2_wellord1)).
% fof(10, conjecture,![X1]:![X2]:![X3]:(relation(X3)=>subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2))),file('/tmp/SRASS.s.p', t21_wellord1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:(relation(X3)=>subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)))),inference(assume_negation,[status(cth)],[10])).
% fof(22, plain,![X1]:(~(relation(X1))|![X2]:![X3]:((~(X3=fiber(X1,X2))|![X4]:((~(in(X4,X3))|(~(X4=X2)&in(ordered_pair(X4,X2),X1)))&((X4=X2|~(in(ordered_pair(X4,X2),X1)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(X4=X2|~(in(ordered_pair(X4,X2),X1))))&(in(X4,X3)|(~(X4=X2)&in(ordered_pair(X4,X2),X1))))|X3=fiber(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(23, plain,![X5]:(~(relation(X5))|![X6]:![X7]:((~(X7=fiber(X5,X6))|![X8]:((~(in(X8,X7))|(~(X8=X6)&in(ordered_pair(X8,X6),X5)))&((X8=X6|~(in(ordered_pair(X8,X6),X5)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(X9=X6|~(in(ordered_pair(X9,X6),X5))))&(in(X9,X7)|(~(X9=X6)&in(ordered_pair(X9,X6),X5))))|X7=fiber(X5,X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:(~(relation(X5))|![X6]:![X7]:((~(X7=fiber(X5,X6))|![X8]:((~(in(X8,X7))|(~(X8=X6)&in(ordered_pair(X8,X6),X5)))&((X8=X6|~(in(ordered_pair(X8,X6),X5)))|in(X8,X7))))&(((~(in(esk2_3(X5,X6,X7),X7))|(esk2_3(X5,X6,X7)=X6|~(in(ordered_pair(esk2_3(X5,X6,X7),X6),X5))))&(in(esk2_3(X5,X6,X7),X7)|(~(esk2_3(X5,X6,X7)=X6)&in(ordered_pair(esk2_3(X5,X6,X7),X6),X5))))|X7=fiber(X5,X6)))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(X8,X7))|(~(X8=X6)&in(ordered_pair(X8,X6),X5)))&((X8=X6|~(in(ordered_pair(X8,X6),X5)))|in(X8,X7)))|~(X7=fiber(X5,X6)))&(((~(in(esk2_3(X5,X6,X7),X7))|(esk2_3(X5,X6,X7)=X6|~(in(ordered_pair(esk2_3(X5,X6,X7),X6),X5))))&(in(esk2_3(X5,X6,X7),X7)|(~(esk2_3(X5,X6,X7)=X6)&in(ordered_pair(esk2_3(X5,X6,X7),X6),X5))))|X7=fiber(X5,X6)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((((((~(X8=X6)|~(in(X8,X7)))|~(X7=fiber(X5,X6)))|~(relation(X5)))&(((in(ordered_pair(X8,X6),X5)|~(in(X8,X7)))|~(X7=fiber(X5,X6)))|~(relation(X5))))&((((X8=X6|~(in(ordered_pair(X8,X6),X5)))|in(X8,X7))|~(X7=fiber(X5,X6)))|~(relation(X5))))&((((~(in(esk2_3(X5,X6,X7),X7))|(esk2_3(X5,X6,X7)=X6|~(in(ordered_pair(esk2_3(X5,X6,X7),X6),X5))))|X7=fiber(X5,X6))|~(relation(X5)))&((((~(esk2_3(X5,X6,X7)=X6)|in(esk2_3(X5,X6,X7),X7))|X7=fiber(X5,X6))|~(relation(X5)))&(((in(ordered_pair(esk2_3(X5,X6,X7),X6),X5)|in(esk2_3(X5,X6,X7),X7))|X7=fiber(X5,X6))|~(relation(X5)))))),inference(distribute,[status(thm)],[25])).
% cnf(30,plain,(in(X4,X2)|X4=X3|~relation(X1)|X2!=fiber(X1,X3)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(31,plain,(in(ordered_pair(X4,X3),X1)|~relation(X1)|X2!=fiber(X1,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(32,plain,(~relation(X1)|X2!=fiber(X1,X3)|~in(X4,X2)|X4!=X3),inference(split_conjunct,[status(thm)],[26])).
% fof(37, 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)],[5])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% cnf(42,plain,(in(X2,X1)|~relation(X1)|~in(X2,relation_restriction(X1,X3))),inference(split_conjunct,[status(thm)],[39])).
% fof(46, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(47, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk4_2(X4,X5),X4)&~(in(esk4_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk4_2(X4,X5),X4)&~(in(esk4_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk4_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk4_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(subset(X1,X2)|~in(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(subset(X1,X2)|in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(57, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_restriction(X3,X4))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(relation(relation_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation(X3)&~(subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(60, negated_conjecture,?[X4]:?[X5]:?[X6]:(relation(X6)&~(subset(fiber(relation_restriction(X6,X4),X5),fiber(X6,X5)))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,(relation(esk7_0)&~(subset(fiber(relation_restriction(esk7_0,esk5_0),esk6_0),fiber(esk7_0,esk6_0)))),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(~subset(fiber(relation_restriction(esk7_0,esk5_0),esk6_0),fiber(esk7_0,esk6_0))),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,negated_conjecture,(relation(esk7_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,plain,(fiber(X1,X2)!=X3|~in(X2,X3)|~relation(X1)),inference(er,[status(thm)],[32,theory(equality)])).
% cnf(71,plain,(in(ordered_pair(X1,X2),X3)|~in(X1,fiber(X3,X2))|~relation(X3)),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(81,plain,(~in(X1,fiber(X2,X1))|~relation(X2)),inference(er,[status(thm)],[64,theory(equality)])).
% cnf(86,plain,(in(ordered_pair(X1,X2),X3)|~relation(X3)|~in(X1,fiber(relation_restriction(X3,X4),X2))|~relation(relation_restriction(X3,X4))),inference(spm,[status(thm)],[42,71,theory(equality)])).
% cnf(107,plain,(in(ordered_pair(X1,X2),X3)|~in(X1,fiber(relation_restriction(X3,X4),X2))|~relation(X3)),inference(csr,[status(thm)],[86,58])).
% cnf(109,plain,(in(ordered_pair(esk4_2(fiber(relation_restriction(X1,X2),X3),X4),X3),X1)|subset(fiber(relation_restriction(X1,X2),X3),X4)|~relation(X1)),inference(spm,[status(thm)],[107,52,theory(equality)])).
% cnf(307,plain,(X1=esk4_2(fiber(relation_restriction(X2,X3),X1),X4)|in(esk4_2(fiber(relation_restriction(X2,X3),X1),X4),X5)|subset(fiber(relation_restriction(X2,X3),X1),X4)|fiber(X2,X1)!=X5|~relation(X2)),inference(spm,[status(thm)],[30,109,theory(equality)])).
% cnf(6706,plain,(subset(fiber(relation_restriction(X1,X2),X3),X4)|esk4_2(fiber(relation_restriction(X1,X2),X3),X4)=X3|fiber(X1,X3)!=X4|~relation(X1)),inference(spm,[status(thm)],[51,307,theory(equality)])).
% cnf(6714,plain,(subset(fiber(relation_restriction(X1,X2),X3),X4)|in(X3,fiber(relation_restriction(X1,X2),X3))|fiber(X1,X3)!=X4|~relation(X1)),inference(spm,[status(thm)],[52,6706,theory(equality)])).
% cnf(6789,plain,(subset(fiber(relation_restriction(X1,X2),X3),fiber(X1,X3))|in(X3,fiber(relation_restriction(X1,X2),X3))|~relation(X1)),inference(er,[status(thm)],[6714,theory(equality)])).
% cnf(6791,negated_conjecture,(in(esk6_0,fiber(relation_restriction(esk7_0,esk5_0),esk6_0))|~relation(esk7_0)),inference(spm,[status(thm)],[62,6789,theory(equality)])).
% cnf(6792,negated_conjecture,(in(esk6_0,fiber(relation_restriction(esk7_0,esk5_0),esk6_0))|$false),inference(rw,[status(thm)],[6791,63,theory(equality)])).
% cnf(6793,negated_conjecture,(in(esk6_0,fiber(relation_restriction(esk7_0,esk5_0),esk6_0))),inference(cn,[status(thm)],[6792,theory(equality)])).
% cnf(6795,negated_conjecture,(~relation(relation_restriction(esk7_0,esk5_0))),inference(spm,[status(thm)],[81,6793,theory(equality)])).
% cnf(6805,negated_conjecture,(~relation(esk7_0)),inference(spm,[status(thm)],[6795,58,theory(equality)])).
% cnf(6806,negated_conjecture,($false),inference(rw,[status(thm)],[6805,63,theory(equality)])).
% cnf(6807,negated_conjecture,($false),inference(cn,[status(thm)],[6806,theory(equality)])).
% cnf(6808,negated_conjecture,($false),6807,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 994
% # ...of these trivial : 1
% # ...subsumed : 523
% # ...remaining for further processing: 470
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 6228
% # ...of the previous two non-trivial : 6133
% # Contextual simplify-reflections : 433
% # Paramodulations : 6215
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 466
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 456
% # Current number of unprocessed clauses: 5041
% # ...number of literals in the above : 27604
% # Clause-clause subsumption calls (NU) : 36332
% # Rec. Clause-clause subsumption calls : 22286
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 250 leaves, 4.23+/-6.699 terms/leaf
% # Paramod-from index: 60 leaves, 3.37+/-6.696 terms/leaf
% # Paramod-into index: 196 leaves, 3.83+/-6.769 terms/leaf
% # -------------------------------------------------
% # User time : 0.367 s
% # System time : 0.015 s
% # Total time : 0.382 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.58 CPU 0.65 WC
% FINAL PrfWatch: 0.58 CPU 0.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP12771/SEU251+1.tptp
%
%------------------------------------------------------------------------------