%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN072+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 09:19:11 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP8904/SYN072+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8904/SYN072+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8904/SYN072+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 9000
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,big_p(a),file('/tmp/SRASS.s.p', pel49_2)).
% fof(2, axiom,big_p(b),file('/tmp/SRASS.s.p', pel49_3)).
% fof(3, axiom,?[X1]:?[X2]:![X3]:(X3=X1|X3=X2),file('/tmp/SRASS.s.p', pel49_1)).
% fof(4, axiom,~(a=b),file('/tmp/SRASS.s.p', pel49_4)).
% fof(5, conjecture,![X1]:big_p(X1),file('/tmp/SRASS.s.p', pel49)).
% fof(6, negated_conjecture,~(![X1]:big_p(X1)),inference(assume_negation,[status(cth)],[5])).
% cnf(7,plain,(big_p(a)),inference(split_conjunct,[status(thm)],[1])).
% cnf(8,plain,(big_p(b)),inference(split_conjunct,[status(thm)],[2])).
% fof(9, plain,?[X4]:?[X5]:![X6]:(X6=X4|X6=X5),inference(variable_rename,[status(thm)],[3])).
% fof(10, plain,![X6]:(X6=esk1_0|X6=esk2_0),inference(skolemize,[status(esa)],[9])).
% cnf(11,plain,(X1=esk2_0|X1=esk1_0),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(a!=b),inference(split_conjunct,[status(thm)],[4])).
% fof(13, negated_conjecture,?[X1]:~(big_p(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(14, negated_conjecture,?[X2]:~(big_p(X2)),inference(variable_rename,[status(thm)],[13])).
% fof(15, negated_conjecture,~(big_p(esk3_0)),inference(skolemize,[status(esa)],[14])).
% cnf(16,negated_conjecture,(~big_p(esk3_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(19,negated_conjecture,(esk1_0=esk3_0|~big_p(esk2_0)),inference(spm,[status(thm)],[16,11,theory(equality)])).
% cnf(21,plain,(esk1_0=X1|X2=X1|esk1_0=X2),inference(spm,[status(thm)],[11,11,theory(equality)])).
% cnf(23,negated_conjecture,(esk3_0=esk1_0|esk1_0=X1|~big_p(X1)),inference(spm,[status(thm)],[19,11,theory(equality)])).
% cnf(24,negated_conjecture,(esk3_0=esk1_0|esk1_0=b),inference(spm,[status(thm)],[23,8,theory(equality)])).
% cnf(25,negated_conjecture,(esk3_0=esk1_0|esk1_0=a),inference(spm,[status(thm)],[23,7,theory(equality)])).
% cnf(26,negated_conjecture,(esk1_0=b|~big_p(esk1_0)),inference(spm,[status(thm)],[16,24,theory(equality)])).
% cnf(27,negated_conjecture,(esk1_0=a|~big_p(esk1_0)),inference(spm,[status(thm)],[16,25,theory(equality)])).
% cnf(76,negated_conjecture,(X2=b|esk1_0=X1|X1=X2|~big_p(X2)),inference(spm,[status(thm)],[26,21,theory(equality)])).
% cnf(95,negated_conjecture,(esk1_0=X1|a=b|X1=a),inference(spm,[status(thm)],[76,7,theory(equality)])).
% cnf(96,negated_conjecture,(esk1_0=X1|X1=a),inference(sr,[status(thm)],[95,12,theory(equality)])).
% cnf(110,negated_conjecture,(X1=a|~big_p(X1)),inference(spm,[status(thm)],[27,96,theory(equality)])).
% cnf(113,negated_conjecture,(b=a),inference(spm,[status(thm)],[110,8,theory(equality)])).
% cnf(114,negated_conjecture,($false),inference(sr,[status(thm)],[113,12,theory(equality)])).
% cnf(115,negated_conjecture,($false),114,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 91
% # ...of the previous two non-trivial : 60
% # Contextual simplify-reflections : 5
% # Paramodulations : 63
% # Factorizations : 28
% # Equation resolutions : 0
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 127
% # Clause-clause subsumption calls (NU) : 29
% # Rec. Clause-clause subsumption calls : 27
% # 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: 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 11 leaves, 1.09+/-0.287 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP8904/SYN072+1.tptp
%
%------------------------------------------------------------------------------