TSTP Solution File: LCL452+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL452+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 13:24:25 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP32518/LCL452+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32518/LCL452+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32518/LCL452+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 32614
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn2<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2)))),file('/tmp/SRASS.s.p', cn2)).
% fof(3, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(12, axiom,or_1,file('/tmp/SRASS.s.p', hilbert_or_1)).
% fof(25, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(33, axiom,(or_1<=>![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4)))),file('/tmp/SRASS.s.p', or_1)).
% fof(46, axiom,(op_implies_and=>![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(49, axiom,(op_or=>![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_or)).
% fof(53, conjecture,cn2,file('/tmp/SRASS.s.p', luka_cn2)).
% fof(54, negated_conjecture,~(cn2),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(cn2),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(cn2)|![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(not(X1),X2))))|cn2)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(not(X5),X6))))|cn2)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(~(is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0))))|cn2)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(not(X3),X4)))|~(cn2))&(~(is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0))))|cn2)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(cn2|~is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0)))),inference(split_conjunct,[status(thm)],[59])).
% cnf(68,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[3])).
% cnf(77,plain,(or_1),inference(split_conjunct,[status(thm)],[12])).
% cnf(128,plain,(op_or),inference(split_conjunct,[status(thm)],[25])).
% fof(151, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X3,or(X3,X4))))|or_1)),inference(fof_nnf,[status(thm)],[33])).
% fof(152, plain,((~(or_1)|![X5]:![X6]:is_a_theorem(implies(X5,or(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X7,or(X7,X8))))|or_1)),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,((~(or_1)|![X5]:![X6]:is_a_theorem(implies(X5,or(X5,X6))))&(~(is_a_theorem(implies(esk27_0,or(esk27_0,esk28_0))))|or_1)),inference(skolemize,[status(esa)],[152])).
% fof(154, plain,![X5]:![X6]:((is_a_theorem(implies(X5,or(X5,X6)))|~(or_1))&(~(is_a_theorem(implies(esk27_0,or(esk27_0,esk28_0))))|or_1)),inference(shift_quantors,[status(thm)],[153])).
% cnf(156,plain,(is_a_theorem(implies(X1,or(X1,X2)))|~or_1),inference(split_conjunct,[status(thm)],[154])).
% fof(229, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(fof_nnf,[status(thm)],[46])).
% fof(230, plain,(~(op_implies_and)|![X5]:![X6]:implies(X5,X6)=not(and(X5,not(X6)))),inference(variable_rename,[status(thm)],[229])).
% fof(231, plain,![X5]:![X6]:(implies(X5,X6)=not(and(X5,not(X6)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[230])).
% cnf(232,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[231])).
% fof(245, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[49])).
% fof(246, plain,(~(op_or)|![X5]:![X6]:or(X5,X6)=not(and(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[245])).
% fof(247, plain,![X5]:![X6]:(or(X5,X6)=not(and(not(X5),not(X6)))|~(op_or)),inference(shift_quantors,[status(thm)],[246])).
% cnf(248,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[247])).
% cnf(258,negated_conjecture,(~cn2),inference(split_conjunct,[status(thm)],[55])).
% cnf(264,plain,(~is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0)))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(284,plain,(is_a_theorem(implies(X1,or(X1,X2)))|$false),inference(rw,[status(thm)],[156,77,theory(equality)])).
% cnf(285,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(cn,[status(thm)],[284,theory(equality)])).
% cnf(300,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[232,68,theory(equality)])).
% cnf(301,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[300,theory(equality)])).
% cnf(316,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[248,301,theory(equality)])).
% cnf(317,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[316,128,theory(equality)])).
% cnf(318,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[317,theory(equality)])).
% cnf(330,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[264,318,theory(equality)]),285,theory(equality)])).
% cnf(331,plain,($false),inference(cn,[status(thm)],[330,theory(equality)])).
% cnf(332,plain,($false),331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 66
% # ...of these trivial : 21
% # ...subsumed : 1
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 19
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 28
% # ...number of literals in the above : 53
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 65 leaves, 1.23+/-0.456 terms/leaf
% # Paramod-from index: 25 leaves, 1.16+/-0.367 terms/leaf
% # Paramod-into index: 58 leaves, 1.17+/-0.378 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP32518/LCL452+1.tptp
%
%------------------------------------------------------------------------------