TSTP Solution File: CSR147+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR147+1 : TPTP v5.0.0. Released v4.1.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 : Wed Dec 29 04:19:11 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP5063/CSR147+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5063/CSR147+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5063/CSR147+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 5159
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,~(s__has_seen_more(geoff,jim)),file('/tmp/SRASS.s.p', jim_has_seen_more)).
% fof(3, axiom,s__Human(jim),file('/tmp/SRASS.s.p', jim_human)).
% fof(5, axiom,geoff=s__siblingFn(jim),file('/tmp/SRASS.s.p', geoff_and_jim)).
% fof(9, axiom,s__age(geoff,n48),file('/tmp/SRASS.s.p', geoff_48)).
% fof(10, axiom,s__age(jim,n54),file('/tmp/SRASS.s.p', jim_54)).
% fof(11, axiom,![X4]:![X5]:![X6]:(s__Human(X4)=>(((s__age(X4,X5)&s__age(s__siblingFn(X4),X6))&greater(X5,X6))=>(s__more_experienced(X4,s__siblingFn(X4))|s__has_seen_more(s__siblingFn(X4),X4)))),file('/tmp/SRASS.s.p', experience)).
% fof(13, axiom,greater(n54,n48),file('/tmp/SRASS.s.p', greater_54_48)).
% fof(14, conjecture,s__more_experienced(jim,geoff),file('/tmp/SRASS.s.p', jim_is_experienced)).
% fof(15, negated_conjecture,~(s__more_experienced(jim,geoff)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,~(s__has_seen_more(geoff,jim)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(17, negated_conjecture,~(s__more_experienced(jim,geoff)),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% cnf(18,plain,(~s__has_seen_more(geoff,jim)),inference(split_conjunct,[status(thm)],[16])).
% cnf(20,plain,(s__Human(jim)),inference(split_conjunct,[status(thm)],[3])).
% cnf(24,plain,(geoff=s__siblingFn(jim)),inference(split_conjunct,[status(thm)],[5])).
% cnf(34,plain,(s__age(geoff,n48)),inference(split_conjunct,[status(thm)],[9])).
% cnf(35,plain,(s__age(jim,n54)),inference(split_conjunct,[status(thm)],[10])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(s__Human(X4))|(((~(s__age(X4,X5))|~(s__age(s__siblingFn(X4),X6)))|~(greater(X5,X6)))|(s__more_experienced(X4,s__siblingFn(X4))|s__has_seen_more(s__siblingFn(X4),X4)))),inference(fof_nnf,[status(thm)],[11])).
% fof(37, plain,![X7]:![X8]:![X9]:(~(s__Human(X7))|(((~(s__age(X7,X8))|~(s__age(s__siblingFn(X7),X9)))|~(greater(X8,X9)))|(s__more_experienced(X7,s__siblingFn(X7))|s__has_seen_more(s__siblingFn(X7),X7)))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(s__has_seen_more(s__siblingFn(X1),X1)|s__more_experienced(X1,s__siblingFn(X1))|~greater(X2,X3)|~s__age(s__siblingFn(X1),X3)|~s__age(X1,X2)|~s__Human(X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,plain,(greater(n54,n48)),inference(split_conjunct,[status(thm)],[13])).
% cnf(43,negated_conjecture,(~s__more_experienced(jim,geoff)),inference(split_conjunct,[status(thm)],[17])).
% cnf(52,plain,(s__more_experienced(jim,geoff)|s__has_seen_more(geoff,jim)|~greater(X1,X2)|~s__age(geoff,X2)|~s__age(jim,X1)|~s__Human(jim)),inference(spm,[status(thm)],[38,24,theory(equality)])).
% cnf(53,plain,(s__more_experienced(jim,geoff)|s__has_seen_more(geoff,jim)|~greater(X1,X2)|~s__age(geoff,X2)|~s__age(jim,X1)|$false),inference(rw,[status(thm)],[52,20,theory(equality)])).
% cnf(54,plain,(s__more_experienced(jim,geoff)|s__has_seen_more(geoff,jim)|~greater(X1,X2)|~s__age(geoff,X2)|~s__age(jim,X1)),inference(cn,[status(thm)],[53,theory(equality)])).
% cnf(55,plain,(s__has_seen_more(geoff,jim)|~greater(X1,X2)|~s__age(geoff,X2)|~s__age(jim,X1)),inference(sr,[status(thm)],[54,43,theory(equality)])).
% cnf(56,plain,(~greater(X1,X2)|~s__age(geoff,X2)|~s__age(jim,X1)),inference(sr,[status(thm)],[55,18,theory(equality)])).
% cnf(57,plain,(~s__age(geoff,n48)|~s__age(jim,n54)),inference(spm,[status(thm)],[56,42,theory(equality)])).
% cnf(58,plain,($false|~s__age(jim,n54)),inference(rw,[status(thm)],[57,34,theory(equality)])).
% cnf(59,plain,($false|$false),inference(rw,[status(thm)],[58,35,theory(equality)])).
% cnf(60,plain,($false),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,plain,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 28 leaves, 1.11+/-0.309 terms/leaf
% # Paramod-from index: 10 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 21 leaves, 1.05+/-0.213 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP5063/CSR147+1.tptp
%
%------------------------------------------------------------------------------