TSTP Solution File: SWC391+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC391+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 : art04.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 08:01:46 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/SystemOnTPTP29599/SWC391+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29599/SWC391+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29599/SWC391+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 29695
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 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))|~(X4=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5)))))))),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))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))))))),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))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))))))),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)&X4=X3)&?[X5]:(ssItem(X5)&(memberP(X1,X5)&~(memberP(X2,X5))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&(((X7=X9&X6=X8)&X9=X8)&?[X10]:(ssItem(X10)&(memberP(X6,X10)&~(memberP(X7,X10))))))))),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)&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(esk51_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(esk51_0=esk48_0),inference(rw,[status(thm)],[574,575,theory(equality)])).
% cnf(582,negated_conjecture,(esk49_0=esk48_0),inference(rw,[status(thm)],[576,581,theory(equality)])).
% cnf(1316,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[571,582,theory(equality)]),572,theory(equality)])).
% cnf(1317,negated_conjecture,($false),inference(cn,[status(thm)],[1316,theory(equality)])).
% cnf(1318,negated_conjecture,($false),1317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 199
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 196
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 545
% # ...of the previous two non-trivial : 445
% # Contextual simplify-reflections : 2
% # Paramodulations : 454
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 444
% # ...number of literals in the above : 3164
% # Clause-clause subsumption calls (NU) : 852
% # Rec. Clause-clause subsumption calls : 159
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 225 leaves, 1.36+/-1.154 terms/leaf
% # Paramod-from index: 99 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 190 leaves, 1.24+/-0.997 terms/leaf
% # -------------------------------------------------
% # User time : 0.061 s
% # System time : 0.008 s
% # Total time : 0.069 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP29599/SWC391+1.tptp
%
%------------------------------------------------------------------------------