TSTP Solution File: SYN318+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN318+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 : art09.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:21:02 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP12133/SYN318+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12133/SYN318+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12133/SYN318+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 12229
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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_f(X2)=>(big_f(X1)=>big_g(X2)))=>(p=>![X2]:(big_f(X2)=>big_g(X1)))),file('/tmp/SRASS.s.p', church_46_2_4)).
% fof(2, negated_conjecture,~(?[X1]:(![X2]:(big_f(X2)=>(big_f(X1)=>big_g(X2)))=>(p=>![X2]:(big_f(X2)=>big_g(X1))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,![X1]:(![X2]:(~(big_f(X2))|(~(big_f(X1))|big_g(X2)))&(p&?[X2]:(big_f(X2)&~(big_g(X1))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,![X3]:(![X4]:(~(big_f(X4))|(~(big_f(X3))|big_g(X4)))&(p&?[X5]:(big_f(X5)&~(big_g(X3))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X3]:(![X4]:(~(big_f(X4))|(~(big_f(X3))|big_g(X4)))&(p&(big_f(esk1_1(X3))&~(big_g(X3))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X3]:![X4]:((~(big_f(X4))|(~(big_f(X3))|big_g(X4)))&(p&(big_f(esk1_1(X3))&~(big_g(X3))))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~big_g(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_f(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_g(X1)|~big_f(X2)|~big_f(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(~big_f(X2)|~big_f(X1)),inference(sr,[status(thm)],[10,7,theory(equality)])).
% fof(12, plain,(~(epred1_0)<=>![X2]:~(big_f(X2))),introduced(definition),['split']).
% cnf(13,plain,(epred1_0|~big_f(X2)),inference(split_equiv,[status(thm)],[12])).
% fof(14, plain,(~(epred2_0)<=>![X1]:~(big_f(X1))),introduced(definition),['split']).
% cnf(15,plain,(epred2_0|~big_f(X1)),inference(split_equiv,[status(thm)],[14])).
% cnf(16,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[11,12,theory(equality)]),14,theory(equality)]),['split']).
% cnf(17,negated_conjecture,(epred1_0),inference(spm,[status(thm)],[13,8,theory(equality)])).
% cnf(18,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[15,8,theory(equality)])).
% cnf(19,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[16,17,theory(equality)])).
% cnf(20,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(23,negated_conjecture,($false),inference(rw,[status(thm)],[20,18,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 : 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 : 3
% # Generated clauses : 5
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 4
% # 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) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.003 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP12133/SYN318+1.tptp
%
%------------------------------------------------------------------------------