TSTP Solution File: SWC103+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC103+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 : art01.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 07:04:04 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP32388/SWC103+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32388/SWC103+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32388/SWC103+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 32484
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 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)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&frontsegP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(frontsegP(X4,X3))))))))),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)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&frontsegP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(frontsegP(X4,X3)))))))))),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)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&frontsegP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(frontsegP(X4,X3)))))))))),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))&(nil=X3|~(nil=X4)))&(~(neq(X1,nil))|~(frontsegP(X2,X1))))&(~(neq(X4,nil))|(neq(X3,nil)&frontsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((((X6=X8&X5=X7)&neq(X6,nil))&(nil=X7|~(nil=X8)))&(~(neq(X5,nil))|~(frontsegP(X6,X5))))&(~(neq(X8,nil))|(neq(X7,nil)&frontsegP(X8,X7)))))))),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))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0))))&(~(neq(esk51_0,nil))|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, 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))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0))))&((neq(esk50_0,nil)|~(neq(esk51_0,nil)))&(frontsegP(esk51_0,esk50_0)|~(neq(esk51_0,nil))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(frontsegP(esk51_0,esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(neq(esk50_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(~frontsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(588,negated_conjecture,(~neq(esk50_0,nil)|~frontsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[574,577,theory(equality)])).
% cnf(589,negated_conjecture,(~neq(esk50_0,nil)|~frontsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[588,578,theory(equality)]),577,theory(equality)])).
% cnf(590,negated_conjecture,(neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[573,587,theory(equality)])).
% cnf(591,negated_conjecture,(neq(esk50_0,nil)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(592,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[589,591,theory(equality)])).
% cnf(593,negated_conjecture,(~frontsegP(esk51_0,esk50_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(594,negated_conjecture,(frontsegP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[572,587,theory(equality)])).
% cnf(595,negated_conjecture,(frontsegP(esk51_0,esk50_0)),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(1323,negated_conjecture,($false),inference(rw,[status(thm)],[593,595,theory(equality)])).
% cnf(1324,negated_conjecture,($false),inference(cn,[status(thm)],[1323,theory(equality)])).
% cnf(1325,negated_conjecture,($false),1324,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 200
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 197
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 544
% # ...of the previous two non-trivial : 444
% # Contextual simplify-reflections : 2
% # Paramodulations : 453
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 189
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 443
% # ...number of literals in the above : 3164
% # Clause-clause subsumption calls (NU) : 851
% # Rec. Clause-clause subsumption calls : 157
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 226 leaves, 1.36+/-1.223 terms/leaf
% # Paramod-from index: 100 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 191 leaves, 1.26+/-1.094 terms/leaf
% # -------------------------------------------------
% # User time : 0.064 s
% # System time : 0.006 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.26 WC
% FINAL PrfWatch: 0.21 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP32388/SWC103+1.tptp
%
%------------------------------------------------------------------------------