TSTP Solution File: SYN066+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN066+1 : TPTP v5.0.0. Bugfixed v3.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:23:17 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP25249/SYN066+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25249/SYN066+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25249/SYN066+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 25381
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:?[X2]:big_q(X1,X2)=>![X3]:big_r(X3,X3)),file('/tmp/SRASS.s.p', pel37_3)).
% fof(2, axiom,![X3]:?[X4]:![X1]:?[X2]:(((big_p(X1,X3)=>big_p(X2,X4))&big_p(X2,X3))&(big_p(X2,X4)=>?[X5]:big_q(X5,X4))),file('/tmp/SRASS.s.p', pel37_1)).
% fof(3, axiom,![X1]:![X3]:(~(big_p(X1,X3))=>?[X2]:big_q(X2,X3)),file('/tmp/SRASS.s.p', pel37_2)).
% fof(4, conjecture,![X1]:?[X2]:big_r(X1,X2),file('/tmp/SRASS.s.p', pel37)).
% fof(5, negated_conjecture,~(![X1]:?[X2]:big_r(X1,X2)),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X3]:(~(big_p(X1,X3))=>?[X2]:big_q(X2,X3)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(7, plain,(![X1]:![X2]:~(big_q(X1,X2))|![X3]:big_r(X3,X3)),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,(![X4]:![X5]:~(big_q(X4,X5))|![X6]:big_r(X6,X6)),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X4]:![X5]:![X6]:(big_r(X6,X6)|~(big_q(X4,X5))),inference(shift_quantors,[status(thm)],[8])).
% cnf(10,plain,(big_r(X3,X3)|~big_q(X1,X2)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, plain,![X3]:?[X4]:![X1]:?[X2]:(((~(big_p(X1,X3))|big_p(X2,X4))&big_p(X2,X3))&(~(big_p(X2,X4))|?[X5]:big_q(X5,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X6]:?[X7]:![X8]:?[X9]:(((~(big_p(X8,X6))|big_p(X9,X7))&big_p(X9,X6))&(~(big_p(X9,X7))|?[X10]:big_q(X10,X7))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X6]:![X8]:(((~(big_p(X8,X6))|big_p(esk2_2(X6,X8),esk1_1(X6)))&big_p(esk2_2(X6,X8),X6))&(~(big_p(esk2_2(X6,X8),esk1_1(X6)))|big_q(esk3_2(X6,X8),esk1_1(X6)))),inference(skolemize,[status(esa)],[12])).
% cnf(14,plain,(big_q(esk3_2(X1,X2),esk1_1(X1))|~big_p(esk2_2(X1,X2),esk1_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% fof(17, plain,![X1]:![X3]:(big_p(X1,X3)|?[X2]:big_q(X2,X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(18, plain,![X4]:![X5]:(big_p(X4,X5)|?[X6]:big_q(X6,X5)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:(big_p(X4,X5)|big_q(esk4_2(X4,X5),X5)),inference(skolemize,[status(esa)],[18])).
% cnf(20,plain,(big_q(esk4_2(X1,X2),X2)|big_p(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, negated_conjecture,?[X1]:![X2]:~(big_r(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(22, negated_conjecture,?[X3]:![X4]:~(big_r(X3,X4)),inference(variable_rename,[status(thm)],[21])).
% fof(23, negated_conjecture,![X4]:~(big_r(esk5_0,X4)),inference(skolemize,[status(esa)],[22])).
% cnf(24,negated_conjecture,(~big_r(esk5_0,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,(~(epred1_0)<=>![X3]:big_r(X3,X3)),introduced(definition),['split']).
% cnf(26,plain,(epred1_0|big_r(X3,X3)),inference(split_equiv,[status(thm)],[25])).
% fof(27, plain,(~(epred2_0)<=>![X2]:![X1]:~(big_q(X1,X2))),introduced(definition),['split']).
% cnf(28,plain,(epred2_0|~big_q(X1,X2)),inference(split_equiv,[status(thm)],[27])).
% cnf(29,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[10,25,theory(equality)]),27,theory(equality)]),['split']).
% cnf(30,negated_conjecture,(epred1_0),inference(spm,[status(thm)],[24,26,theory(equality)])).
% cnf(31,plain,(epred2_0|big_p(X1,X2)),inference(spm,[status(thm)],[28,20,theory(equality)])).
% cnf(33,plain,(~epred2_0|$false),inference(rw,[status(thm)],[29,30,theory(equality)])).
% cnf(34,plain,(~epred2_0),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(36,plain,(big_p(X1,X2)),inference(sr,[status(thm)],[31,34,theory(equality)])).
% cnf(42,plain,(big_q(esk3_2(X1,X2),esk1_1(X1))|$false),inference(rw,[status(thm)],[14,36,theory(equality)])).
% cnf(43,plain,(big_q(esk3_2(X1,X2),esk1_1(X1))),inference(cn,[status(thm)],[42,theory(equality)])).
% cnf(44,plain,(epred2_0),inference(spm,[status(thm)],[28,43,theory(equality)])).
% cnf(45,plain,($false),inference(sr,[status(thm)],[44,34,theory(equality)])).
% cnf(46,plain,($false),45,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 7
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 0
% # 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) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 10 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 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/SystemOnTPTP25249/SYN066+1.tptp
%
%------------------------------------------------------------------------------