TSTP Solution File: LCL469+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL469+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 : 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 : Wed Dec 29 13:30:43 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP8227/LCL469+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8227/LCL469+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8227/LCL469+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 8323
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(or_1<=>![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2)))),file('/tmp/SRASS.s.p', or_1)).
% fof(4, axiom,cn2,file('/tmp/SRASS.s.p', luka_cn2)).
% fof(13, axiom,op_or,file('/tmp/SRASS.s.p', luka_op_or)).
% fof(17, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(24, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(35, axiom,(cn2<=>![X4]:![X5]:is_a_theorem(implies(X4,implies(not(X4),X5)))),file('/tmp/SRASS.s.p', cn2)).
% fof(39, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(43, conjecture,or_1,file('/tmp/SRASS.s.p', hilbert_or_1)).
% fof(44, negated_conjecture,~(or_1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(or_1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(or_1)|![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,or(X1,X2))))|or_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,or(X5,X6))))|or_1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(~(is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))))|or_1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(X3,or(X3,X4)))|~(or_1))&(~(is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))))|or_1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(or_1|~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(54,plain,(cn2),inference(split_conjunct,[status(thm)],[4])).
% cnf(98,plain,(op_or),inference(split_conjunct,[status(thm)],[13])).
% cnf(102,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[17])).
% fof(137, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[24])).
% fof(138, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[138])).
% cnf(140,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[139])).
% fof(199, plain,((~(cn2)|![X4]:![X5]:is_a_theorem(implies(X4,implies(not(X4),X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X4,implies(not(X4),X5))))|cn2)),inference(fof_nnf,[status(thm)],[35])).
% fof(200, plain,((~(cn2)|![X6]:![X7]:is_a_theorem(implies(X6,implies(not(X6),X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X8,implies(not(X8),X9))))|cn2)),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,((~(cn2)|![X6]:![X7]:is_a_theorem(implies(X6,implies(not(X6),X7))))&(~(is_a_theorem(implies(esk48_0,implies(not(esk48_0),esk49_0))))|cn2)),inference(skolemize,[status(esa)],[200])).
% fof(202, plain,![X6]:![X7]:((is_a_theorem(implies(X6,implies(not(X6),X7)))|~(cn2))&(~(is_a_theorem(implies(esk48_0,implies(not(esk48_0),esk49_0))))|cn2)),inference(shift_quantors,[status(thm)],[201])).
% cnf(204,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2),inference(split_conjunct,[status(thm)],[202])).
% fof(221, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(222, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[221])).
% fof(223, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[222])).
% cnf(224,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[223])).
% cnf(238,negated_conjecture,(~or_1),inference(split_conjunct,[status(thm)],[45])).
% cnf(244,plain,(~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(251,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[224,102,theory(equality)])).
% cnf(252,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(256,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|$false),inference(rw,[status(thm)],[204,54,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(265,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[140,252,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[265,98,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(271,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(rw,[status(thm)],[257,267,theory(equality)])).
% cnf(302,plain,($false),inference(rw,[status(thm)],[244,271,theory(equality)])).
% cnf(303,plain,($false),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(304,plain,($false),303,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 78
% # ...of these trivial : 11
% # ...subsumed : 1
% # ...remaining for further processing: 66
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 20
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections : 0
% # Paramodulations : 20
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 59
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 16
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 71
% # Unit Clause-clause subsumption calls : 91
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 185 leaves, 1.24+/-0.905 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 156 leaves, 1.07+/-0.425 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.002 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP8227/LCL469+1.tptp
%
%------------------------------------------------------------------------------