↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYN350+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 : 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 : Thu Dec 30 09:24:14 EST 2010

% Result   : Theorem 1.04s
% Output   : Solution 1.04s
% 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/SystemOnTPTP5165/SYN350+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP5165/SYN350+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5165/SYN350+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 5261
% 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,![X1]:?[X2]:?[X3]:![X4]:((big_f(X1,X4)<=>big_f(X4,X1))=>(big_f(X1,X4)<=>(big_f(X3,X4)&(big_f(X2,X4)=>big_f(X2,X3))))),file('/tmp/SRASS.s.p', church_46_18_2)).
% fof(2, negated_conjecture,~(![X1]:?[X2]:?[X3]:![X4]:((big_f(X1,X4)<=>big_f(X4,X1))=>(big_f(X1,X4)<=>(big_f(X3,X4)&(big_f(X2,X4)=>big_f(X2,X3)))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:![X2]:![X3]:?[X4]:(((~(big_f(X1,X4))|big_f(X4,X1))&(~(big_f(X4,X1))|big_f(X1,X4)))&((~(big_f(X1,X4))|(~(big_f(X3,X4))|(big_f(X2,X4)&~(big_f(X2,X3)))))&(big_f(X1,X4)|(big_f(X3,X4)&(~(big_f(X2,X4))|big_f(X2,X3)))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X5]:![X6]:![X7]:?[X8]:(((~(big_f(X5,X8))|big_f(X8,X5))&(~(big_f(X8,X5))|big_f(X5,X8)))&((~(big_f(X5,X8))|(~(big_f(X7,X8))|(big_f(X6,X8)&~(big_f(X6,X7)))))&(big_f(X5,X8)|(big_f(X7,X8)&(~(big_f(X6,X8))|big_f(X6,X7)))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X6]:![X7]:(((~(big_f(esk1_0,esk2_2(X6,X7)))|big_f(esk2_2(X6,X7),esk1_0))&(~(big_f(esk2_2(X6,X7),esk1_0))|big_f(esk1_0,esk2_2(X6,X7))))&((~(big_f(esk1_0,esk2_2(X6,X7)))|(~(big_f(X7,esk2_2(X6,X7)))|(big_f(X6,esk2_2(X6,X7))&~(big_f(X6,X7)))))&(big_f(esk1_0,esk2_2(X6,X7))|(big_f(X7,esk2_2(X6,X7))&(~(big_f(X6,esk2_2(X6,X7)))|big_f(X6,X7)))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X6]:![X7]:(((~(big_f(esk1_0,esk2_2(X6,X7)))|big_f(esk2_2(X6,X7),esk1_0))&(~(big_f(esk2_2(X6,X7),esk1_0))|big_f(esk1_0,esk2_2(X6,X7))))&((((big_f(X6,esk2_2(X6,X7))|~(big_f(X7,esk2_2(X6,X7))))|~(big_f(esk1_0,esk2_2(X6,X7))))&((~(big_f(X6,X7))|~(big_f(X7,esk2_2(X6,X7))))|~(big_f(esk1_0,esk2_2(X6,X7)))))&((big_f(X7,esk2_2(X6,X7))|big_f(esk1_0,esk2_2(X6,X7)))&((~(big_f(X6,esk2_2(X6,X7)))|big_f(X6,X7))|big_f(esk1_0,esk2_2(X6,X7)))))),inference(distribute,[status(thm)],[5])).
% cnf(8,negated_conjecture,(big_f(esk1_0,esk2_2(X1,X2))|big_f(X2,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(~big_f(esk1_0,esk2_2(X1,X2))|~big_f(X2,esk2_2(X1,X2))|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(big_f(esk2_2(X1,X2),esk1_0)|~big_f(esk1_0,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(big_f(esk1_0,esk2_2(X3,esk1_0))),inference(ef,[status(thm)],[8,theory(equality)])).
% cnf(21,negated_conjecture,(~big_f(esk1_0,esk2_2(X1,esk1_0))|~big_f(X1,esk1_0)),inference(spm,[status(thm)],[9,14,theory(equality)])).
% cnf(24,negated_conjecture,($false|~big_f(X1,esk1_0)),inference(rw,[status(thm)],[21,14,theory(equality)])).
% cnf(25,negated_conjecture,(~big_f(X1,esk1_0)),inference(cn,[status(thm)],[24,theory(equality)])).
% cnf(42,negated_conjecture,(~big_f(esk1_0,esk2_2(X1,X2))),inference(spm,[status(thm)],[25,12,theory(equality)])).
% cnf(47,negated_conjecture,($false),inference(sr,[status(thm)],[14,42,theory(equality)])).
% cnf(48,negated_conjecture,($false),47,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 20
% # ...of these trivial              : 1
% # ...subsumed                      : 2
% # ...remaining for further processing: 17
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 0
% # Generated clauses                : 21
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections  : 1
% # Paramodulations                  : 16
% # Factorizations                   : 2
% # Equation resolutions             : 0
% # Current number of processed clauses: 8
% #    Positive orientable unit clauses: 1
% #    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 : 2
% # Clause-clause subsumption calls (NU) : 23
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 1
% # Indexed BW rewrite successes     : 0
% # Backwards rewriting index:    10 leaves,   1.10+/-0.300 terms/leaf
% # Paramod-from index:            2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            8 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.011 s
% # System time          : 0.001 s
% # Total time           : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.17 WC
% FINAL PrfWatch: 0.12 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5165/SYN350+1.tptp
% 
%------------------------------------------------------------------------------