TSTP Solution File: SEU080+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU080+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 00:59:32 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP3744/SEU080+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3744/SEU080+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3744/SEU080+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 3840
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(3, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(4, axiom,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>((subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))&subset(X1,relation_rng(X3)))=>subset(X1,X2))),file('/tmp/SRASS.s.p', t158_funct_1)).
% fof(33, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(((relation_inverse_image(X3,X1)=relation_inverse_image(X3,X2)&subset(X1,relation_rng(X3)))&subset(X2,relation_rng(X3)))=>X1=X2)),file('/tmp/SRASS.s.p', t161_funct_1)).
% fof(34, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(((relation_inverse_image(X3,X1)=relation_inverse_image(X3,X2)&subset(X1,relation_rng(X3)))&subset(X2,relation_rng(X3)))=>X1=X2))),inference(assume_negation,[status(cth)],[33])).
% fof(41, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(42, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(51, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(52,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X1]:![X2]:![X3]:((~(relation(X3))|~(function(X3)))|((~(subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)))|~(subset(X1,relation_rng(X3))))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(54, plain,![X4]:![X5]:![X6]:((~(relation(X6))|~(function(X6)))|((~(subset(relation_inverse_image(X6,X4),relation_inverse_image(X6,X5)))|~(subset(X4,relation_rng(X6))))|subset(X4,X5))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X2)|~subset(X1,relation_rng(X3))|~subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))|~function(X3)|~relation(X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(153, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&(((relation_inverse_image(X3,X1)=relation_inverse_image(X3,X2)&subset(X1,relation_rng(X3)))&subset(X2,relation_rng(X3)))&~(X1=X2))),inference(fof_nnf,[status(thm)],[34])).
% fof(154, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&(((relation_inverse_image(X6,X4)=relation_inverse_image(X6,X5)&subset(X4,relation_rng(X6)))&subset(X5,relation_rng(X6)))&~(X4=X5))),inference(variable_rename,[status(thm)],[153])).
% fof(155, negated_conjecture,((relation(esk14_0)&function(esk14_0))&(((relation_inverse_image(esk14_0,esk12_0)=relation_inverse_image(esk14_0,esk13_0)&subset(esk12_0,relation_rng(esk14_0)))&subset(esk13_0,relation_rng(esk14_0)))&~(esk12_0=esk13_0))),inference(skolemize,[status(esa)],[154])).
% cnf(156,negated_conjecture,(esk12_0!=esk13_0),inference(split_conjunct,[status(thm)],[155])).
% cnf(157,negated_conjecture,(subset(esk13_0,relation_rng(esk14_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(158,negated_conjecture,(subset(esk12_0,relation_rng(esk14_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(159,negated_conjecture,(relation_inverse_image(esk14_0,esk12_0)=relation_inverse_image(esk14_0,esk13_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(160,negated_conjecture,(function(esk14_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(161,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(233,negated_conjecture,(subset(X1,esk13_0)|~subset(relation_inverse_image(esk14_0,X1),relation_inverse_image(esk14_0,esk12_0))|~function(esk14_0)|~relation(esk14_0)|~subset(X1,relation_rng(esk14_0))),inference(pm,[status(thm)],[55,159,theory(equality)])).
% cnf(234,negated_conjecture,(subset(esk13_0,X1)|~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1))|~function(esk14_0)|~relation(esk14_0)|~subset(esk13_0,relation_rng(esk14_0))),inference(pm,[status(thm)],[55,159,theory(equality)])).
% cnf(236,negated_conjecture,(subset(X1,esk13_0)|~subset(relation_inverse_image(esk14_0,X1),relation_inverse_image(esk14_0,esk12_0))|$false|~relation(esk14_0)|~subset(X1,relation_rng(esk14_0))),inference(rw,[status(thm)],[233,160,theory(equality)])).
% cnf(237,negated_conjecture,(subset(X1,esk13_0)|~subset(relation_inverse_image(esk14_0,X1),relation_inverse_image(esk14_0,esk12_0))|$false|$false|~subset(X1,relation_rng(esk14_0))),inference(rw,[status(thm)],[236,161,theory(equality)])).
% cnf(238,negated_conjecture,(subset(X1,esk13_0)|~subset(relation_inverse_image(esk14_0,X1),relation_inverse_image(esk14_0,esk12_0))|~subset(X1,relation_rng(esk14_0))),inference(cn,[status(thm)],[237,theory(equality)])).
% cnf(239,negated_conjecture,(subset(esk13_0,X1)|~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1))|$false|~relation(esk14_0)|~subset(esk13_0,relation_rng(esk14_0))),inference(rw,[status(thm)],[234,160,theory(equality)])).
% cnf(240,negated_conjecture,(subset(esk13_0,X1)|~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1))|$false|$false|~subset(esk13_0,relation_rng(esk14_0))),inference(rw,[status(thm)],[239,161,theory(equality)])).
% cnf(241,negated_conjecture,(subset(esk13_0,X1)|~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1))|$false|$false|$false),inference(rw,[status(thm)],[240,157,theory(equality)])).
% cnf(242,negated_conjecture,(subset(esk13_0,X1)|~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1))),inference(cn,[status(thm)],[241,theory(equality)])).
% cnf(391,negated_conjecture,(subset(esk12_0,esk13_0)|~subset(esk12_0,relation_rng(esk14_0))),inference(pm,[status(thm)],[238,52,theory(equality)])).
% cnf(396,negated_conjecture,(subset(esk12_0,esk13_0)|$false),inference(rw,[status(thm)],[391,158,theory(equality)])).
% cnf(397,negated_conjecture,(subset(esk12_0,esk13_0)),inference(cn,[status(thm)],[396,theory(equality)])).
% cnf(398,negated_conjecture,(esk13_0=esk12_0|~subset(esk13_0,esk12_0)),inference(pm,[status(thm)],[44,397,theory(equality)])).
% cnf(400,negated_conjecture,(~subset(esk13_0,esk12_0)),inference(sr,[status(thm)],[398,156,theory(equality)])).
% cnf(414,negated_conjecture,(subset(esk13_0,esk12_0)),inference(pm,[status(thm)],[242,52,theory(equality)])).
% cnf(418,negated_conjecture,($false),inference(sr,[status(thm)],[414,400,theory(equality)])).
% cnf(419,negated_conjecture,($false),418,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 140
% # ...of these trivial : 4
% # ...subsumed : 18
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 20
% # Generated clauses : 150
% # ...of the previous two non-trivial : 117
% # Contextual simplify-reflections : 0
% # Paramodulations : 142
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 41
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 16
% # Clause-clause subsumption calls (NU) : 62
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 89
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 114 leaves, 1.15+/-0.500 terms/leaf
% # Paramod-from index: 47 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 101 leaves, 1.11+/-0.443 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.003 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP3744/SEU080+1.tptp
%
%------------------------------------------------------------------------------