TSTP Solution File: SWC102+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC102+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:03:57 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP32126/SWC102+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32126/SWC102+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32126/SWC102+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 32222
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(X4=X3))|~(neq(X2,nil)))|(neq(X1,nil)&frontsegP(X2,X1))))))),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))|~(X4=X3))|~(neq(X2,nil)))|(neq(X1,nil)&frontsegP(X2,X1)))))))),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))|~(X4=X3))|~(neq(X2,nil)))|(neq(X1,nil)&frontsegP(X2,X1)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(119, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&X4=X3)&neq(X2,nil))&(~(neq(X1,nil))|~(frontsegP(X2,X1)))))))),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)&X8=X7)&neq(X6,nil))&(~(neq(X5,nil))|~(frontsegP(X6,X5)))))))),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)&esk51_0=esk50_0)&neq(esk49_0,nil))&(~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~frontsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(esk51_0=esk50_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(579,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk49_0=esk50_0),inference(rw,[status(thm)],[573,575,theory(equality)])).
% cnf(581,negated_conjecture,(esk49_0=esk48_0),inference(rw,[status(thm)],[580,574,theory(equality)])).
% cnf(586,negated_conjecture,(neq(esk48_0,nil)),inference(rw,[status(thm)],[572,581,theory(equality)])).
% cnf(587,negated_conjecture,($false|~frontsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[571,586,theory(equality)])).
% cnf(588,negated_conjecture,($false|~frontsegP(esk48_0,esk48_0)),inference(rw,[status(thm)],[587,581,theory(equality)])).
% cnf(589,negated_conjecture,(~frontsegP(esk48_0,esk48_0)),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(593,negated_conjecture,(~ssList(esk48_0)),inference(spm,[status(thm)],[589,121,theory(equality)])).
% cnf(594,negated_conjecture,($false),inference(rw,[status(thm)],[593,579,theory(equality)])).
% cnf(595,negated_conjecture,($false),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(596,negated_conjecture,($false),595,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 3
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 170
% # ...number of literals in the above : 676
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 31 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 19 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.002 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP32126/SWC102+1.tptp
%
%------------------------------------------------------------------------------