TSTP Solution File: SWC362+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC362+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:01:56 EST 2010
% Result : Theorem 1.44s
% Output : Solution 1.44s
% 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/SystemOnTPTP7772/SWC362+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7772/SWC362+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7772/SWC362+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 7904
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 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))|~(segmentP(X4,X3)))|segmentP(X2,X1))&(~(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))|~(segmentP(X4,X3)))|segmentP(X2,X1))&(~(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))|~(segmentP(X4,X3)))|segmentP(X2,X1))&(~(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)&segmentP(X4,X3))&~(segmentP(X2,X1)))|(neq(X2,nil)&~(neq(X4,nil))))))))),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)&segmentP(X8,X7))&~(segmentP(X6,X5)))|(neq(X6,nil)&~(neq(X8,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)&segmentP(esk51_0,esk50_0))&~(segmentP(esk49_0,esk48_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),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)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))&((neq(esk49_0,nil)|segmentP(esk51_0,esk50_0))&(~(neq(esk51_0,nil))|segmentP(esk51_0,esk50_0))))&((neq(esk49_0,nil)|~(segmentP(esk49_0,esk48_0)))&(~(neq(esk51_0,nil))|~(segmentP(esk49_0,esk48_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(segmentP(esk51_0,esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),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(586,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[572,579,theory(equality)]),577,theory(equality)])).
% cnf(587,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[586,theory(equality)])).
% cnf(592,negated_conjecture,(segmentP(esk49_0,esk48_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[574,579,theory(equality)]),578,theory(equality)])).
% cnf(593,negated_conjecture,(segmentP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[592,579,theory(equality)]),577,theory(equality)])).
% cnf(594,negated_conjecture,(segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,($false),inference(sr,[status(thm)],[594,587,theory(equality)])).
% cnf(596,negated_conjecture,($false),595,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 13
% # ...of these trivial : 4
% # ...subsumed : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 187
% # ...number of literals in the above : 705
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.004 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP7772/SWC362+1.tptp
%
%------------------------------------------------------------------------------