TSTP Solution File: SYN317+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN317+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:21:00 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/SystemOnTPTP3095/SYN317+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3095/SYN317+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3095/SYN317+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 3194
% 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]:(big_f(X1)=>big_g(X1))<=>?[X1]:?[X2]:(big_f(X1)=>big_g(X2))),file('/tmp/SRASS.s.p', church_46_2_3)).
% fof(2, negated_conjecture,~((?[X1]:(big_f(X1)=>big_g(X1))<=>?[X1]:?[X2]:(big_f(X1)=>big_g(X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((![X1]:(big_f(X1)&~(big_g(X1)))|![X1]:![X2]:(big_f(X1)&~(big_g(X2))))&(?[X1]:(~(big_f(X1))|big_g(X1))|?[X1]:?[X2]:(~(big_f(X1))|big_g(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((![X3]:(big_f(X3)&~(big_g(X3)))|![X4]:![X5]:(big_f(X4)&~(big_g(X5))))&(?[X6]:(~(big_f(X6))|big_g(X6))|?[X7]:?[X8]:(~(big_f(X7))|big_g(X8)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((![X3]:(big_f(X3)&~(big_g(X3)))|![X4]:![X5]:(big_f(X4)&~(big_g(X5))))&((~(big_f(esk1_0))|big_g(esk1_0))|(~(big_f(esk2_0))|big_g(esk3_0)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X3]:![X4]:![X5]:(((big_f(X4)&~(big_g(X5)))|(big_f(X3)&~(big_g(X3))))&((~(big_f(esk1_0))|big_g(esk1_0))|(~(big_f(esk2_0))|big_g(esk3_0)))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X3]:![X4]:![X5]:((((big_f(X3)|big_f(X4))&(~(big_g(X3))|big_f(X4)))&((big_f(X3)|~(big_g(X5)))&(~(big_g(X3))|~(big_g(X5)))))&((~(big_f(esk1_0))|big_g(esk1_0))|(~(big_f(esk2_0))|big_g(esk3_0)))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_g(esk3_0)|big_g(esk1_0)|~big_f(esk2_0)|~big_f(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~big_g(X1)|~big_g(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_f(X1)|big_f(X2)),inference(split_conjunct,[status(thm)],[7])).
% fof(13, plain,(~(epred1_0)<=>![X2]:~(big_g(X2))),introduced(definition),['split']).
% cnf(14,plain,(epred1_0|~big_g(X2)),inference(split_equiv,[status(thm)],[13])).
% fof(15, plain,(~(epred2_0)<=>![X1]:~(big_g(X1))),introduced(definition),['split']).
% cnf(16,plain,(epred2_0|~big_g(X1)),inference(split_equiv,[status(thm)],[15])).
% cnf(17,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,13,theory(equality)]),15,theory(equality)]),['split']).
% cnf(18,negated_conjecture,(big_f(X3)),inference(ef,[status(thm)],[12,theory(equality)])).
% cnf(24,negated_conjecture,(big_g(esk1_0)|big_g(esk3_0)|$false|~big_f(esk2_0)),inference(rw,[status(thm)],[8,18,theory(equality)])).
% cnf(25,negated_conjecture,(big_g(esk1_0)|big_g(esk3_0)|$false|$false),inference(rw,[status(thm)],[24,18,theory(equality)])).
% cnf(26,negated_conjecture,(big_g(esk1_0)|big_g(esk3_0)),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(27,negated_conjecture,(epred1_0|big_g(esk1_0)),inference(spm,[status(thm)],[14,26,theory(equality)])).
% cnf(28,negated_conjecture,(epred2_0|big_g(esk1_0)),inference(spm,[status(thm)],[16,26,theory(equality)])).
% cnf(29,negated_conjecture,(epred1_0),inference(csr,[status(thm)],[27,14])).
% cnf(30,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[17,29,theory(equality)])).
% cnf(31,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(33,negated_conjecture,(big_g(esk1_0)),inference(sr,[status(thm)],[28,31,theory(equality)])).
% cnf(34,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[16,33,theory(equality)])).
% cnf(36,negated_conjecture,($false),inference(sr,[status(thm)],[34,31,theory(equality)])).
% cnf(37,negated_conjecture,($false),36,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 11
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 1
% # Paramodulations : 6
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 15
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 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/SystemOnTPTP3095/SYN317+1.tptp
%
%------------------------------------------------------------------------------