TSTP Solution File: SYN071+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN071+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 : 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 : Thu Dec 30 09:19:05 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP10521/SYN071+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10521/SYN071+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10521/SYN071+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 10617
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.008 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(a=b|c=d),file('/tmp/SRASS.s.p', pel48_1)).
% fof(2, axiom,(a=c|b=d),file('/tmp/SRASS.s.p', pel48_2)).
% fof(3, conjecture,(a=d|b=c),file('/tmp/SRASS.s.p', pel48)).
% fof(4, negated_conjecture,~((a=d|b=c)),inference(assume_negation,[status(cth)],[3])).
% cnf(5,plain,(c=d|a=b),inference(split_conjunct,[status(thm)],[1])).
% cnf(6,plain,(b=d|a=c),inference(split_conjunct,[status(thm)],[2])).
% fof(7, negated_conjecture,(~(a=d)&~(b=c)),inference(fof_nnf,[status(thm)],[4])).
% cnf(8,negated_conjecture,(b!=c),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(a!=d),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,plain,(d=a|c=d|c=a),inference(spm,[status(thm)],[5,6,theory(equality)])).
% cnf(11,negated_conjecture,(c=d|a!=c),inference(spm,[status(thm)],[8,5,theory(equality)])).
% cnf(13,plain,(c=d|c=a),inference(sr,[status(thm)],[10,9,theory(equality)])).
% cnf(15,negated_conjecture,(c=d),inference(csr,[status(thm)],[11,13])).
% cnf(19,plain,(d=a|b=d),inference(rw,[status(thm)],[6,15,theory(equality)])).
% cnf(20,plain,(b=d),inference(sr,[status(thm)],[19,9,theory(equality)])).
% cnf(22,negated_conjecture,(b!=d),inference(rw,[status(thm)],[8,15,theory(equality)])).
% cnf(23,negated_conjecture,($false),inference(rw,[status(thm)],[22,20,theory(equality)])).
% cnf(24,negated_conjecture,($false),inference(cn,[status(thm)],[23,theory(equality)])).
% cnf(25,negated_conjecture,($false),24,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 12
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 4
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 1
% # Paramodulations : 3
% # Factorizations : 1
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.002 s
% # Total time : 0.009 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP10521/SYN071+1.tptp
%
%------------------------------------------------------------------------------