TSTP Solution File: SWC051+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC051+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 06:59:45 EST 2010
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP17159/SWC051+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17159/SWC051+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17159/SWC051+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 17291
% 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(5, axiom,![X1]:(ssList(X1)=>rearsegP(X1,X1)),file('/tmp/SRASS.s.p', ax49)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(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)))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(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)))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(119, plain,![X1]:(~(ssList(X1))|rearsegP(X1,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|rearsegP(X2,X2)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(rearsegP(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)&neq(X2,nil))&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(rearsegP(X2,X5)))|~(rearsegP(X1,X5))))&(nil=X3|~(nil=X4)))&(~(neq(X4,nil))|(neq(X3,nil)&rearsegP(X4,X3)))))))),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)&neq(X7,nil))&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(X7,X10)))|~(rearsegP(X6,X10))))&(nil=X8|~(nil=X9)))&(~(neq(X9,nil))|(neq(X8,nil)&rearsegP(X9,X8)))))))),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))&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10))))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk51_0,nil))|(neq(esk50_0,nil)&rearsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk51_0,nil))|(neq(esk50_0,nil)&rearsegP(esk51_0,esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(nil=esk50_0|~(nil=esk51_0)))&((neq(esk50_0,nil)|~(neq(esk51_0,nil)))&(rearsegP(esk51_0,esk50_0)|~(neq(esk51_0,nil)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(rearsegP(esk51_0,esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(neq(esk50_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(~rearsegP(esk48_0,X1)|~rearsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,581,theory(equality)])).
% cnf(588,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[580,582,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[578,588,theory(equality)])).
% cnf(590,negated_conjecture,(neq(esk50_0,nil)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(591,negated_conjecture,(rearsegP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[577,588,theory(equality)])).
% cnf(592,negated_conjecture,(rearsegP(esk51_0,esk50_0)),inference(cn,[status(thm)],[591,theory(equality)])).
% cnf(596,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~rearsegP(esk50_0,X1)|~rearsegP(esk49_0,X1)),inference(rw,[status(thm)],[583,581,theory(equality)])).
% cnf(597,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~rearsegP(esk50_0,X1)|~rearsegP(esk51_0,X1)),inference(rw,[status(thm)],[596,582,theory(equality)])).
% cnf(599,negated_conjecture,(~rearsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[597,121,theory(equality)])).
% cnf(603,negated_conjecture,($false|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(rw,[status(thm)],[599,592,theory(equality)])).
% cnf(604,negated_conjecture,($false|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[603,590,theory(equality)])).
% cnf(605,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[604,584,theory(equality)])).
% cnf(606,negated_conjecture,($false),inference(cn,[status(thm)],[605,theory(equality)])).
% cnf(607,negated_conjecture,($false),606,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 169
% # ...number of literals in the above : 674
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 7
% # 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: 37 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 21 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 32 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.002 s
% # Total time : 0.031 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/SystemOnTPTP17159/SWC051+1.tptp
%
%------------------------------------------------------------------------------