TSTP Solution File: SYN057+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN057+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:17:33 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/SystemOnTPTP11097/SYN057+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11097/SYN057+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11097/SYN057+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 11193
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((big_j(X1)&big_i(X1))=>big_f(X1)),file('/tmp/SRASS.s.p', pel27_3)).
% fof(2, axiom,(?[X1]:(big_h(X1)&~(big_g(X1)))=>![X2]:(big_i(X2)=>~(big_h(X2)))),file('/tmp/SRASS.s.p', pel27_4)).
% fof(3, axiom,?[X1]:(big_f(X1)&~(big_g(X1))),file('/tmp/SRASS.s.p', pel27_1)).
% fof(4, axiom,![X1]:(big_f(X1)=>big_h(X1)),file('/tmp/SRASS.s.p', pel27_2)).
% fof(5, conjecture,![X1]:(big_j(X1)=>~(big_i(X1))),file('/tmp/SRASS.s.p', pel27)).
% fof(6, negated_conjecture,~(![X1]:(big_j(X1)=>~(big_i(X1)))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,(?[X1]:(big_h(X1)&~(big_g(X1)))=>![X2]:(big_i(X2)=>~(big_h(X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(8, plain,?[X1]:(big_f(X1)&~(big_g(X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(9, negated_conjecture,~(![X1]:(big_j(X1)=>~(big_i(X1)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(10, plain,![X1]:((~(big_j(X1))|~(big_i(X1)))|big_f(X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,![X2]:((~(big_j(X2))|~(big_i(X2)))|big_f(X2)),inference(variable_rename,[status(thm)],[10])).
% cnf(12,plain,(big_f(X1)|~big_i(X1)|~big_j(X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,(![X1]:(~(big_h(X1))|big_g(X1))|![X2]:(~(big_i(X2))|~(big_h(X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(14, plain,(![X3]:(~(big_h(X3))|big_g(X3))|![X4]:(~(big_i(X4))|~(big_h(X4)))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X3]:![X4]:((~(big_i(X4))|~(big_h(X4)))|(~(big_h(X3))|big_g(X3))),inference(shift_quantors,[status(thm)],[14])).
% cnf(16,plain,(big_g(X1)|~big_h(X1)|~big_h(X2)|~big_i(X2)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,?[X2]:(big_f(X2)&~(big_g(X2))),inference(variable_rename,[status(thm)],[8])).
% fof(18, plain,(big_f(esk1_0)&~(big_g(esk1_0))),inference(skolemize,[status(esa)],[17])).
% cnf(19,plain,(~big_g(esk1_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(big_f(esk1_0)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X1]:(~(big_f(X1))|big_h(X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X2]:(~(big_f(X2))|big_h(X2)),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(big_h(X1)|~big_f(X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, negated_conjecture,?[X1]:(big_j(X1)&big_i(X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(25, negated_conjecture,?[X2]:(big_j(X2)&big_i(X2)),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(big_j(esk2_0)&big_i(esk2_0)),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(big_i(esk2_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(big_j(esk2_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,negated_conjecture,(big_f(esk2_0)|~big_i(esk2_0)),inference(spm,[status(thm)],[12,28,theory(equality)])).
% cnf(30,negated_conjecture,(big_f(esk2_0)|$false),inference(rw,[status(thm)],[29,27,theory(equality)])).
% cnf(31,negated_conjecture,(big_f(esk2_0)),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(32,negated_conjecture,(big_g(X1)|~big_h(esk2_0)|~big_h(X1)),inference(spm,[status(thm)],[16,27,theory(equality)])).
% cnf(33,negated_conjecture,(~big_h(esk2_0)|~big_h(esk1_0)),inference(spm,[status(thm)],[19,32,theory(equality)])).
% cnf(34,negated_conjecture,(~big_h(esk1_0)|~big_f(esk2_0)),inference(spm,[status(thm)],[33,23,theory(equality)])).
% cnf(35,negated_conjecture,(~big_h(esk1_0)|$false),inference(rw,[status(thm)],[34,31,theory(equality)])).
% cnf(36,negated_conjecture,(~big_h(esk1_0)),inference(cn,[status(thm)],[35,theory(equality)])).
% cnf(37,negated_conjecture,(~big_f(esk1_0)),inference(spm,[status(thm)],[36,23,theory(equality)])).
% cnf(38,negated_conjecture,($false),inference(rw,[status(thm)],[37,20,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(cn,[status(thm)],[38,theory(equality)])).
% cnf(40,negated_conjecture,($false),39,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # 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 : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 15 leaves, 1.13+/-0.340 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 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/SystemOnTPTP11097/SYN057+1.tptp
%
%------------------------------------------------------------------------------