TSTP Solution File: CSR004+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR004+2 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Tue Dec 28 22:44:20 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP13912/CSR004+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13912/CSR004+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13912/CSR004+2.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 14008
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,holdsAt(waterLevel(n3),n3),file('/tmp/SRASS.s.p', waterLevel_3)).
% fof(2, axiom,holdsAt(filling,n3),file('/tmp/SRASS.s.p', filling_3)).
% fof(9, axiom,![X2]:![X3]:(happens(X2,X3)<=>((X2=tapOn&X3=n0)|((holdsAt(waterLevel(n3),X3)&holdsAt(filling,X3))&X2=overflow))),file('/tmp/SRASS.s.p', happens_all_defn)).
% fof(57, conjecture,happens(overflow,n3),file('/tmp/SRASS.s.p', overflow_3)).
% fof(58, negated_conjecture,~(happens(overflow,n3)),inference(assume_negation,[status(cth)],[57])).
% fof(72, negated_conjecture,~(happens(overflow,n3)),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% cnf(75,plain,(holdsAt(waterLevel(n3),n3)),inference(split_conjunct,[status(thm)],[1])).
% cnf(76,plain,(holdsAt(filling,n3)),inference(split_conjunct,[status(thm)],[2])).
% fof(84, plain,![X2]:![X3]:((~(happens(X2,X3))|((X2=tapOn&X3=n0)|((holdsAt(waterLevel(n3),X3)&holdsAt(filling,X3))&X2=overflow)))&(((~(X2=tapOn)|~(X3=n0))&((~(holdsAt(waterLevel(n3),X3))|~(holdsAt(filling,X3)))|~(X2=overflow)))|happens(X2,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(85, plain,![X4]:![X5]:((~(happens(X4,X5))|((X4=tapOn&X5=n0)|((holdsAt(waterLevel(n3),X5)&holdsAt(filling,X5))&X4=overflow)))&(((~(X4=tapOn)|~(X5=n0))&((~(holdsAt(waterLevel(n3),X5))|~(holdsAt(filling,X5)))|~(X4=overflow)))|happens(X4,X5))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X4]:![X5]:((((((holdsAt(waterLevel(n3),X5)|X4=tapOn)|~(happens(X4,X5)))&((holdsAt(filling,X5)|X4=tapOn)|~(happens(X4,X5))))&((X4=overflow|X4=tapOn)|~(happens(X4,X5))))&((((holdsAt(waterLevel(n3),X5)|X5=n0)|~(happens(X4,X5)))&((holdsAt(filling,X5)|X5=n0)|~(happens(X4,X5))))&((X4=overflow|X5=n0)|~(happens(X4,X5)))))&(((~(X4=tapOn)|~(X5=n0))|happens(X4,X5))&(((~(holdsAt(waterLevel(n3),X5))|~(holdsAt(filling,X5)))|~(X4=overflow))|happens(X4,X5)))),inference(distribute,[status(thm)],[85])).
% cnf(87,plain,(happens(X1,X2)|X1!=overflow|~holdsAt(filling,X2)|~holdsAt(waterLevel(n3),X2)),inference(split_conjunct,[status(thm)],[86])).
% cnf(261,negated_conjecture,(~happens(overflow,n3)),inference(split_conjunct,[status(thm)],[72])).
% cnf(361,plain,(happens(overflow,X1)|~holdsAt(waterLevel(n3),X1)|~holdsAt(filling,X1)),inference(er,[status(thm)],[87,theory(equality)])).
% cnf(1125,plain,(happens(overflow,n3)|~holdsAt(waterLevel(n3),n3)),inference(spm,[status(thm)],[361,76,theory(equality)])).
% cnf(1126,plain,(happens(overflow,n3)|$false),inference(rw,[status(thm)],[1125,75,theory(equality)])).
% cnf(1127,plain,(happens(overflow,n3)),inference(cn,[status(thm)],[1126,theory(equality)])).
% cnf(1128,plain,($false),inference(sr,[status(thm)],[1127,261,theory(equality)])).
% cnf(1129,plain,($false),1128,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 378
% # ...of these trivial : 4
% # ...subsumed : 59
% # ...remaining for further processing: 315
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 33
% # Backward-rewritten : 2
% # Generated clauses : 600
% # ...of the previous two non-trivial : 412
% # Contextual simplify-reflections : 20
% # Paramodulations : 580
% # Factorizations : 2
% # Equation resolutions : 18
% # Current number of processed clauses: 278
% # Positive orientable unit clauses: 111
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 50
% # Non-unit-clauses : 116
% # Current number of unprocessed clauses: 101
% # ...number of literals in the above : 370
% # Clause-clause subsumption calls (NU) : 612
% # Rec. Clause-clause subsumption calls : 540
% # Unit Clause-clause subsumption calls : 964
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 47
% # Indexed BW rewrite successes : 35
% # Backwards rewriting index: 268 leaves, 1.22+/-0.804 terms/leaf
% # Paramod-from index: 126 leaves, 1.02+/-0.152 terms/leaf
% # Paramod-into index: 215 leaves, 1.08+/-0.351 terms/leaf
% # -------------------------------------------------
% # User time : 0.053 s
% # System time : 0.005 s
% # Total time : 0.058 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP13912/CSR004+2.tptp
%
%------------------------------------------------------------------------------