TSTP Solution File: SYN356+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN356+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 : 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 09:29:43 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP27963/SYN356+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27963/SYN356+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27963/SYN356+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 28095
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((big_r(a,b)&![X1]:![X2]:(big_r(X1,X2)=>(big_r(X2,X1)&big_q(X1,X2))))&![X3]:![X4]:(big_q(X3,X4)=>big_q(X3,X3)))=>(big_q(a,a)&big_q(b,b))),file('/tmp/SRASS.s.p', x2107)).
% fof(2, negated_conjecture,~((((big_r(a,b)&![X1]:![X2]:(big_r(X1,X2)=>(big_r(X2,X1)&big_q(X1,X2))))&![X3]:![X4]:(big_q(X3,X4)=>big_q(X3,X3)))=>(big_q(a,a)&big_q(b,b)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(((big_r(a,b)&![X1]:![X2]:(~(big_r(X1,X2))|(big_r(X2,X1)&big_q(X1,X2))))&![X3]:![X4]:(~(big_q(X3,X4))|big_q(X3,X3)))&(~(big_q(a,a))|~(big_q(b,b)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(((big_r(a,b)&![X5]:![X6]:(~(big_r(X5,X6))|(big_r(X6,X5)&big_q(X5,X6))))&![X7]:![X8]:(~(big_q(X7,X8))|big_q(X7,X7)))&(~(big_q(a,a))|~(big_q(b,b)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X5]:![X6]:![X7]:![X8]:(((~(big_q(X7,X8))|big_q(X7,X7))&((~(big_r(X5,X6))|(big_r(X6,X5)&big_q(X5,X6)))&big_r(a,b)))&(~(big_q(a,a))|~(big_q(b,b)))),inference(shift_quantors,[status(thm)],[4])).
% fof(6, negated_conjecture,![X5]:![X6]:![X7]:![X8]:(((~(big_q(X7,X8))|big_q(X7,X7))&(((big_r(X6,X5)|~(big_r(X5,X6)))&(big_q(X5,X6)|~(big_r(X5,X6))))&big_r(a,b)))&(~(big_q(a,a))|~(big_q(b,b)))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~big_q(b,b)|~big_q(a,a)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_r(a,b)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_q(X1,X2)|~big_r(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_r(X2,X1)|~big_r(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_q(X1,X1)|~big_q(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(big_q(a,b)),inference(spm,[status(thm)],[9,8,theory(equality)])).
% cnf(13,negated_conjecture,(big_r(b,a)),inference(spm,[status(thm)],[10,8,theory(equality)])).
% cnf(14,negated_conjecture,(big_q(a,a)),inference(spm,[status(thm)],[11,12,theory(equality)])).
% cnf(16,negated_conjecture,(big_q(b,a)),inference(spm,[status(thm)],[9,13,theory(equality)])).
% cnf(19,negated_conjecture,($false|~big_q(b,b)),inference(rw,[status(thm)],[7,14,theory(equality)])).
% cnf(20,negated_conjecture,(~big_q(b,b)),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(22,negated_conjecture,(big_q(b,b)),inference(spm,[status(thm)],[11,16,theory(equality)])).
% cnf(25,negated_conjecture,($false),inference(rw,[status(thm)],[20,22,theory(equality)])).
% cnf(26,negated_conjecture,($false),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(27,negated_conjecture,($false),26,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 8
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.10+/-0.300 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27963/SYN356+1.tptp
%
%------------------------------------------------------------------------------