TSTP Solution File: SWC408+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC408+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:09:28 EST 2010
% Result : Theorem 1.49s
% Output : Solution 1.49s
% 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/SystemOnTPTP14415/SWC408+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14415/SWC408+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14415/SWC408+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 14547
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(app(X4,X4)=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X2,X5))|memberP(X1,X5)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(app(X4,X4)=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X2,X5))|memberP(X1,X5))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(app(X4,X4)=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X2,X5))|memberP(X1,X5))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(113, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[3])).
% fof(114, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[115])).
% cnf(117,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X3,X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((app(X4,X4)=X3&X2=X4)&X1=X3)&?[X5]:(ssItem(X5)&(memberP(X2,X5)&~(memberP(X1,X5))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&(((app(X9,X9)=X8&X7=X9)&X6=X8)&?[X10]:(ssItem(X10)&(memberP(X7,X10)&~(memberP(X6,X10))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((app(esk51_0,esk51_0)=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0)&(ssItem(esk52_0)&(memberP(esk49_0,esk52_0)&~(memberP(esk48_0,esk52_0))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(app(esk51_0,esk51_0)=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[579,575,theory(equality)])).
% cnf(584,negated_conjecture,(app(esk51_0,esk51_0)=esk48_0),inference(rw,[status(thm)],[576,574,theory(equality)])).
% cnf(585,negated_conjecture,(memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[572,575,theory(equality)])).
% cnf(661,negated_conjecture,(memberP(app(X1,esk51_0),esk52_0)|~ssList(esk51_0)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[117,585,theory(equality)])).
% cnf(662,negated_conjecture,(memberP(app(X1,esk51_0),esk52_0)|$false|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[661,581,theory(equality)])).
% cnf(663,negated_conjecture,(memberP(app(X1,esk51_0),esk52_0)|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[662,573,theory(equality)])).
% cnf(664,negated_conjecture,(memberP(app(X1,esk51_0),esk52_0)|~ssList(X1)),inference(cn,[status(thm)],[663,theory(equality)])).
% cnf(1367,negated_conjecture,(memberP(esk48_0,esk52_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[664,584,theory(equality)])).
% cnf(1388,negated_conjecture,(memberP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[1367,581,theory(equality)])).
% cnf(1389,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(cn,[status(thm)],[1388,theory(equality)])).
% cnf(1390,negated_conjecture,($false),inference(sr,[status(thm)],[1389,571,theory(equality)])).
% cnf(1391,negated_conjecture,($false),1390,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 203
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 199
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 571
% # ...of the previous two non-trivial : 463
% # Contextual simplify-reflections : 2
% # Paramodulations : 480
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 193
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 458
% # ...number of literals in the above : 3212
% # Clause-clause subsumption calls (NU) : 830
% # Rec. Clause-clause subsumption calls : 149
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 234 leaves, 1.34+/-1.134 terms/leaf
% # Paramod-from index: 103 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 199 leaves, 1.23+/-0.975 terms/leaf
% # -------------------------------------------------
% # User time : 0.060 s
% # System time : 0.006 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.25 WC
% FINAL PrfWatch: 0.19 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP14415/SWC408+1.tptp
%
%------------------------------------------------------------------------------