TSTP Solution File: SYN078+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN078+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:24:38 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP26296/SYN078+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26296/SYN078+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26296/SYN078+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 26428
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:(?[X2]:(big_p(X2)&X1=f(X2))=>big_p(X1))<=>![X3]:(big_p(X3)=>big_p(f(X3)))),file('/tmp/SRASS.s.p', pel56)).
% fof(2, negated_conjecture,~((![X1]:(?[X2]:(big_p(X2)&X1=f(X2))=>big_p(X1))<=>![X3]:(big_p(X3)=>big_p(f(X3))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((?[X1]:(?[X2]:(big_p(X2)&X1=f(X2))&~(big_p(X1)))|?[X3]:(big_p(X3)&~(big_p(f(X3)))))&(![X1]:(![X2]:(~(big_p(X2))|~(X1=f(X2)))|big_p(X1))|![X3]:(~(big_p(X3))|big_p(f(X3))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((?[X4]:(?[X5]:(big_p(X5)&X4=f(X5))&~(big_p(X4)))|?[X6]:(big_p(X6)&~(big_p(f(X6)))))&(![X7]:(![X8]:(~(big_p(X8))|~(X7=f(X8)))|big_p(X7))|![X9]:(~(big_p(X9))|big_p(f(X9))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((((big_p(esk2_0)&esk1_0=f(esk2_0))&~(big_p(esk1_0)))|(big_p(esk3_0)&~(big_p(f(esk3_0)))))&(![X7]:(![X8]:(~(big_p(X8))|~(X7=f(X8)))|big_p(X7))|![X9]:(~(big_p(X9))|big_p(f(X9))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X7]:![X8]:![X9]:(((~(big_p(X9))|big_p(f(X9)))|((~(big_p(X8))|~(X7=f(X8)))|big_p(X7)))&(((big_p(esk2_0)&esk1_0=f(esk2_0))&~(big_p(esk1_0)))|(big_p(esk3_0)&~(big_p(f(esk3_0)))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X7]:![X8]:![X9]:(((~(big_p(X9))|big_p(f(X9)))|((~(big_p(X8))|~(X7=f(X8)))|big_p(X7)))&((((big_p(esk3_0)|big_p(esk2_0))&(~(big_p(f(esk3_0)))|big_p(esk2_0)))&((big_p(esk3_0)|esk1_0=f(esk2_0))&(~(big_p(f(esk3_0)))|esk1_0=f(esk2_0))))&((big_p(esk3_0)|~(big_p(esk1_0)))&(~(big_p(f(esk3_0)))|~(big_p(esk1_0)))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_p(esk1_0)|~big_p(f(esk3_0))),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(big_p(esk3_0)|~big_p(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(esk1_0=f(esk2_0)|~big_p(f(esk3_0))),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(esk1_0=f(esk2_0)|big_p(esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_p(esk2_0)|~big_p(f(esk3_0))),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(big_p(esk2_0)|big_p(esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(14,negated_conjecture,(big_p(X1)|big_p(f(X3))|X1!=f(X2)|~big_p(X2)|~big_p(X3)),inference(split_conjunct,[status(thm)],[7])).
% cnf(15,negated_conjecture,(big_p(f(X1))|big_p(f(X2))|~big_p(X1)|~big_p(X2)),inference(er,[status(thm)],[14,theory(equality)])).
% cnf(17,negated_conjecture,(big_p(f(X3))|~big_p(X3)),inference(ef,[status(thm)],[15,theory(equality)])).
% cnf(25,negated_conjecture,(f(esk2_0)=esk1_0|~big_p(esk3_0)),inference(spm,[status(thm)],[10,17,theory(equality)])).
% cnf(26,negated_conjecture,(big_p(esk2_0)|~big_p(esk3_0)),inference(spm,[status(thm)],[12,17,theory(equality)])).
% cnf(28,negated_conjecture,(big_p(esk2_0)),inference(csr,[status(thm)],[26,13])).
% cnf(30,negated_conjecture,(f(esk2_0)=esk1_0),inference(csr,[status(thm)],[25,11])).
% cnf(31,negated_conjecture,(big_p(esk1_0)|~big_p(esk2_0)),inference(spm,[status(thm)],[17,30,theory(equality)])).
% cnf(33,negated_conjecture,(big_p(esk1_0)|$false),inference(rw,[status(thm)],[31,28,theory(equality)])).
% cnf(34,negated_conjecture,(big_p(esk1_0)),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,negated_conjecture,(~big_p(f(esk3_0))|$false),inference(rw,[status(thm)],[8,34,theory(equality)])).
% cnf(36,negated_conjecture,(~big_p(f(esk3_0))),inference(cn,[status(thm)],[35,theory(equality)])).
% cnf(37,negated_conjecture,(big_p(esk3_0)|$false),inference(rw,[status(thm)],[9,34,theory(equality)])).
% cnf(38,negated_conjecture,(big_p(esk3_0)),inference(cn,[status(thm)],[37,theory(equality)])).
% cnf(39,negated_conjecture,(~big_p(esk3_0)),inference(spm,[status(thm)],[36,17,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(sr,[status(thm)],[38,39,theory(equality)])).
% cnf(41,negated_conjecture,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 4
% # Generated clauses : 15
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 2
% # Paramodulations : 12
% # Factorizations : 2
% # Equation resolutions : 1
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.002 s
% # Total time : 0.010 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/SystemOnTPTP26296/SYN078+1.tptp
%
%------------------------------------------------------------------------------