TSTP Solution File: SYN376+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN376+1 : TPTP v5.0.0. Bugfixed v2.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 : Thu Dec 30 09:26:56 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/SystemOnTPTP6207/SYN376+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6207/SYN376+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6207/SYN376+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 6303
% 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]:(big_p(X2)<=>big_p(X1))=>(![X1]:big_p(X1)|![X1]:~(big_p(X1)))),file('/tmp/SRASS.s.p', x2127)).
% fof(2, negated_conjecture,~((?[X1]:![X2]:(big_p(X2)<=>big_p(X1))=>(![X1]:big_p(X1)|![X1]:~(big_p(X1))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((?[X1]:![X2]:(big_p(X2)<=>big_p(X1))=>(![X1]:big_p(X1)|![X1]:~(big_p(X1))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,(?[X1]:![X2]:((~(big_p(X2))|big_p(X1))&(~(big_p(X1))|big_p(X2)))&(?[X1]:~(big_p(X1))&?[X1]:big_p(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,(?[X3]:![X4]:((~(big_p(X4))|big_p(X3))&(~(big_p(X3))|big_p(X4)))&(?[X5]:~(big_p(X5))&?[X6]:big_p(X6))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(![X4]:((~(big_p(X4))|big_p(esk1_0))&(~(big_p(esk1_0))|big_p(X4)))&(~(big_p(esk2_0))&big_p(esk3_0))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X4]:(((~(big_p(X4))|big_p(esk1_0))&(~(big_p(esk1_0))|big_p(X4)))&(~(big_p(esk2_0))&big_p(esk3_0))),inference(shift_quantors,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_p(esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~big_p(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(big_p(X1)|~big_p(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_p(esk1_0)|~big_p(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_p(esk1_0)),inference(spm,[status(thm)],[11,8,theory(equality)])).
% cnf(14,negated_conjecture,(big_p(X1)|$false),inference(rw,[status(thm)],[10,12,theory(equality)])).
% cnf(15,negated_conjecture,(big_p(X1)),inference(cn,[status(thm)],[14,theory(equality)])).
% cnf(17,negated_conjecture,($false),inference(rw,[status(thm)],[9,15,theory(equality)])).
% cnf(18,negated_conjecture,($false),inference(cn,[status(thm)],[17,theory(equality)])).
% cnf(19,negated_conjecture,($false),18,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 1
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # 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 : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 1 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.005 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP6207/SYN376+1.tptp
%
%------------------------------------------------------------------------------