TSTP Solution File: SWC008+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC008+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:20 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP5455/SWC008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5455/SWC008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5455/SWC008+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 5551
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(21, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(34, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|?[X8]:((((ssList(X8)&neq(X3,X8))&frontsegP(X4,X8))&segmentP(X8,X3))&equalelemsP(X8))))))),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))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|?[X8]:((((ssList(X8)&neq(X3,X8))&frontsegP(X4,X8))&segmentP(X8,X3))&equalelemsP(X8)))))))),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))|~(frontsegP(X4,X3)))|~(equalelemsP(X3)))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|?[X8]:((((ssList(X8)&neq(X3,X8))&frontsegP(X4,X8))&segmentP(X8,X3))&equalelemsP(X8)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk1_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[107])).
% cnf(109,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[108])).
% cnf(110,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[108])).
% fof(199, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[21])).
% fof(200, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[199])).
% cnf(201,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[200])).
% cnf(261,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[34])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&frontsegP(X4,X3))&equalelemsP(X3))&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X5,X6),X7)=X2))|~(app(X5,X7)=X1)))))&![X8]:((((~(ssList(X8))|~(neq(X3,X8)))|~(frontsegP(X4,X8)))|~(segmentP(X8,X3)))|~(equalelemsP(X8)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(((((X10=X12&X9=X11)&frontsegP(X12,X11))&equalelemsP(X11))&![X13]:(~(ssList(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X13,X14),X15)=X10))|~(app(X13,X15)=X9)))))&![X16]:((((~(ssList(X16))|~(neq(X11,X16)))|~(frontsegP(X12,X16)))|~(segmentP(X16,X11)))|~(equalelemsP(X16)))))))),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)&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0))&![X13]:(~(ssList(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X13,X14),X15)=esk49_0))|~(app(X13,X15)=esk48_0)))))&![X16]:((((~(ssList(X16))|~(neq(esk50_0,X16)))|~(frontsegP(esk51_0,X16)))|~(segmentP(X16,esk50_0)))|~(equalelemsP(X16)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:![X16]:(((((((((~(ssList(X16))|~(neq(esk50_0,X16)))|~(frontsegP(esk51_0,X16)))|~(segmentP(X16,esk50_0)))|~(equalelemsP(X16)))&(((((~(ssList(X15))|~(app(app(X13,X14),X15)=esk49_0))|~(app(X13,X15)=esk48_0))|~(ssList(X14)))|~(ssList(X13)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&equalelemsP(esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(frontsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(~ssList(X1)|~ssList(X2)|app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(583,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(615,negated_conjecture,(app(X1,X3)!=esk50_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(616,negated_conjecture,(app(X1,X3)!=esk50_0|app(app(X1,X2),X3)!=esk51_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[615,579,theory(equality)])).
% cnf(618,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[616,201,theory(equality)])).
% cnf(621,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[618,261,theory(equality)])).
% cnf(622,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[621,theory(equality)])).
% cnf(624,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[110,577,theory(equality)])).
% cnf(627,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[624,582,theory(equality)])).
% cnf(628,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[627,583,theory(equality)])).
% cnf(629,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[628,theory(equality)])).
% cnf(772,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[109,577,theory(equality)])).
% cnf(775,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[772,582,theory(equality)])).
% cnf(776,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|$false|$false),inference(rw,[status(thm)],[775,583,theory(equality)])).
% cnf(777,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0),inference(cn,[status(thm)],[776,theory(equality)])).
% cnf(1705,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)|~ssList(esk50_0)),inference(er,[status(thm)],[622,theory(equality)])).
% cnf(1706,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)|$false),inference(rw,[status(thm)],[1705,582,theory(equality)])).
% cnf(1707,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)),inference(cn,[status(thm)],[1706,theory(equality)])).
% cnf(1709,negated_conjecture,(app(esk51_0,nil)!=esk51_0|~ssList(esk1_2(esk51_0,esk50_0))),inference(spm,[status(thm)],[1707,777,theory(equality)])).
% cnf(1715,negated_conjecture,(app(esk51_0,nil)!=esk51_0|$false),inference(rw,[status(thm)],[1709,629,theory(equality)])).
% cnf(1716,negated_conjecture,(app(esk51_0,nil)!=esk51_0),inference(cn,[status(thm)],[1715,theory(equality)])).
% cnf(1723,negated_conjecture,(~ssList(esk51_0)),inference(spm,[status(thm)],[1716,201,theory(equality)])).
% cnf(1724,negated_conjecture,($false),inference(rw,[status(thm)],[1723,583,theory(equality)])).
% cnf(1725,negated_conjecture,($false),inference(cn,[status(thm)],[1724,theory(equality)])).
% cnf(1726,negated_conjecture,($false),1725,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 257
% # ...of these trivial : 2
% # ...subsumed : 17
% # ...remaining for further processing: 238
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 669
% # ...of the previous two non-trivial : 555
% # Contextual simplify-reflections : 4
% # Paramodulations : 575
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 195
% # Current number of unprocessed clauses: 474
% # ...number of literals in the above : 3336
% # Clause-clause subsumption calls (NU) : 869
% # Rec. Clause-clause subsumption calls : 212
% # Unit Clause-clause subsumption calls : 38
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 263 leaves, 1.32+/-1.142 terms/leaf
% # Paramod-from index: 112 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 222 leaves, 1.22+/-1.018 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.004 s
% # Total time : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.28 WC
% FINAL PrfWatch: 0.18 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP5455/SWC008+1.tptp
%
%------------------------------------------------------------------------------