TSTP Solution File: SWC011+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC011+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 : 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 06:49:50 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP5714/SWC011+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5714/SWC011+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5714/SWC011+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 5810
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(neq(X2,nil))|neq(X4,nil)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X2))|~(app(X6,X7)=X1)))))&?[X8]:(ssItem(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(app(app(X9,cons(X8,nil)),X10)=X4&app(X9,X10)=X3)))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&((X12=X14&X11=X13)&(((neq(X12,nil)&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=X12))|~(app(X16,X17)=X11)))))&?[X18]:(ssItem(X18)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(app(app(X19,cons(X18,nil)),X20)=X14&app(X19,X20)=X13)))))|(neq(X12,nil)&~(neq(X14,nil))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((esk49_0=esk51_0&esk48_0=esk50_0)&(((neq(esk49_0,nil)&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk49_0))|~(app(X16,X17)=esk48_0)))))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0&app(esk53_0,esk54_0)=esk50_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:((((((((((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk49_0))|~(app(X16,X17)=esk48_0))|~(ssList(X16)))|~(ssItem(X15)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0&app(esk53_0,esk54_0)=esk50_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:![X17]:(((((((((neq(esk49_0,nil)|((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk49_0))|~(app(X16,X17)=esk48_0))|~(ssList(X16)))|~(ssItem(X15))))&(~(neq(esk51_0,nil))|((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk49_0))|~(app(X16,X17)=esk48_0))|~(ssList(X16)))|~(ssItem(X15)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&(((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|ssList(esk54_0))&(~(neq(esk51_0,nil))|ssList(esk54_0)))&(((neq(esk49_0,nil)|app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0)&(~(neq(esk51_0,nil))|app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0))&((neq(esk49_0,nil)|app(esk53_0,esk54_0)=esk50_0)&(~(neq(esk51_0,nil))|app(esk53_0,esk54_0)=esk50_0)))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(app(esk53_0,esk54_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk54_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(595,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[587,578,theory(equality)]),590,theory(equality)])).
% cnf(596,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),590,theory(equality)])).
% cnf(598,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(599,negated_conjecture,(ssList(esk54_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),590,theory(equality)])).
% cnf(600,negated_conjecture,(ssList(esk54_0)),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(602,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[601,578,theory(equality)]),590,theory(equality)])).
% cnf(603,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(619,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(620,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[619,578,theory(equality)]),590,theory(equality)])).
% cnf(621,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0),inference(cn,[status(thm)],[620,theory(equality)])).
% cnf(720,negated_conjecture,(app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[591,578,theory(equality)]),590,theory(equality)])).
% cnf(721,negated_conjecture,(app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(cn,[status(thm)],[720,theory(equality)])).
% cnf(722,negated_conjecture,(app(app(esk53_0,cons(X1,nil)),esk54_0)!=esk49_0|~ssList(esk54_0)|~ssList(esk53_0)|~ssItem(X1)),inference(spm,[status(thm)],[721,603,theory(equality)])).
% cnf(727,negated_conjecture,(app(app(esk53_0,cons(X1,nil)),esk54_0)!=esk49_0|$false|~ssList(esk53_0)|~ssItem(X1)),inference(rw,[status(thm)],[722,600,theory(equality)])).
% cnf(728,negated_conjecture,(app(app(esk53_0,cons(X1,nil)),esk54_0)!=esk49_0|$false|$false|~ssItem(X1)),inference(rw,[status(thm)],[727,598,theory(equality)])).
% cnf(729,negated_conjecture,(app(app(esk53_0,cons(X1,nil)),esk54_0)!=esk49_0|~ssItem(X1)),inference(cn,[status(thm)],[728,theory(equality)])).
% cnf(1824,negated_conjecture,(~ssItem(esk52_0)),inference(spm,[status(thm)],[729,621,theory(equality)])).
% cnf(1828,negated_conjecture,($false),inference(rw,[status(thm)],[1824,596,theory(equality)])).
% cnf(1829,negated_conjecture,($false),inference(cn,[status(thm)],[1828,theory(equality)])).
% cnf(1830,negated_conjecture,($false),1829,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 234
% # ...of these trivial : 9
% # ...subsumed : 3
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 697
% # ...of the previous two non-trivial : 583
% # Contextual simplify-reflections : 2
% # Paramodulations : 606
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 211
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 179
% # Current number of unprocessed clauses: 533
% # ...number of literals in the above : 3602
% # Clause-clause subsumption calls (NU) : 902
% # Rec. Clause-clause subsumption calls : 214
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 254 leaves, 1.32+/-1.093 terms/leaf
% # Paramod-from index: 113 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 214 leaves, 1.22+/-0.944 terms/leaf
% # -------------------------------------------------
% # User time : 0.074 s
% # System time : 0.003 s
% # Total time : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP5714/SWC011+1.tptp
%
%------------------------------------------------------------------------------