TSTP Solution File: LCL529+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL529+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:49:47 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP24867/LCL529+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24867/LCL529+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24867/LCL529+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 24963
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,and_1,file('/tmp/SRASS.s.p', hilbert_and_1)).
% fof(8, axiom,(axiom_m2<=>![X1]:![X2]:is_a_theorem(strict_implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', axiom_m2)).
% fof(30, axiom,necessitation,file('/tmp/SRASS.s.p', km5_necessitation)).
% fof(36, axiom,op_strict_implies,file('/tmp/SRASS.s.p', s1_0_op_strict_implies)).
% fof(38, axiom,(and_1<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', and_1)).
% fof(47, axiom,(necessitation<=>![X1]:(is_a_theorem(X1)=>is_a_theorem(necessarily(X1)))),file('/tmp/SRASS.s.p', necessitation)).
% fof(62, axiom,(op_strict_implies=>![X1]:![X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))),file('/tmp/SRASS.s.p', op_strict_implies)).
% fof(88, conjecture,axiom_m2,file('/tmp/SRASS.s.p', s1_0_axiom_m2)).
% fof(89, negated_conjecture,~(axiom_m2),inference(assume_negation,[status(cth)],[88])).
% fof(90, negated_conjecture,~(axiom_m2),inference(fof_simplification,[status(thm)],[89,theory(equality)])).
% cnf(115,plain,(and_1),inference(split_conjunct,[status(thm)],[5])).
% fof(118, plain,((~(axiom_m2)|![X1]:![X2]:is_a_theorem(strict_implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(strict_implies(and(X1,X2),X1)))|axiom_m2)),inference(fof_nnf,[status(thm)],[8])).
% fof(119, plain,((~(axiom_m2)|![X3]:![X4]:is_a_theorem(strict_implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(strict_implies(and(X5,X6),X5)))|axiom_m2)),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,((~(axiom_m2)|![X3]:![X4]:is_a_theorem(strict_implies(and(X3,X4),X3)))&(~(is_a_theorem(strict_implies(and(esk10_0,esk11_0),esk10_0)))|axiom_m2)),inference(skolemize,[status(esa)],[119])).
% fof(121, plain,![X3]:![X4]:((is_a_theorem(strict_implies(and(X3,X4),X3))|~(axiom_m2))&(~(is_a_theorem(strict_implies(and(esk10_0,esk11_0),esk10_0)))|axiom_m2)),inference(shift_quantors,[status(thm)],[120])).
% cnf(122,plain,(axiom_m2|~is_a_theorem(strict_implies(and(esk10_0,esk11_0),esk10_0))),inference(split_conjunct,[status(thm)],[121])).
% cnf(171,plain,(necessitation),inference(split_conjunct,[status(thm)],[30])).
% cnf(177,plain,(op_strict_implies),inference(split_conjunct,[status(thm)],[36])).
% fof(179, plain,((~(and_1)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X1)))|and_1)),inference(fof_nnf,[status(thm)],[38])).
% fof(180, plain,((~(and_1)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X5)))|and_1)),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,((~(and_1)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(~(is_a_theorem(implies(and(esk20_0,esk21_0),esk20_0)))|and_1)),inference(skolemize,[status(esa)],[180])).
% fof(182, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X3))|~(and_1))&(~(is_a_theorem(implies(and(esk20_0,esk21_0),esk20_0)))|and_1)),inference(shift_quantors,[status(thm)],[181])).
% cnf(184,plain,(is_a_theorem(implies(and(X1,X2),X1))|~and_1),inference(split_conjunct,[status(thm)],[182])).
% fof(233, plain,((~(necessitation)|![X1]:(~(is_a_theorem(X1))|is_a_theorem(necessarily(X1))))&(?[X1]:(is_a_theorem(X1)&~(is_a_theorem(necessarily(X1))))|necessitation)),inference(fof_nnf,[status(thm)],[47])).
% fof(234, plain,((~(necessitation)|![X2]:(~(is_a_theorem(X2))|is_a_theorem(necessarily(X2))))&(?[X3]:(is_a_theorem(X3)&~(is_a_theorem(necessarily(X3))))|necessitation)),inference(variable_rename,[status(thm)],[233])).
% fof(235, plain,((~(necessitation)|![X2]:(~(is_a_theorem(X2))|is_a_theorem(necessarily(X2))))&((is_a_theorem(esk34_0)&~(is_a_theorem(necessarily(esk34_0))))|necessitation)),inference(skolemize,[status(esa)],[234])).
% fof(236, plain,![X2]:(((~(is_a_theorem(X2))|is_a_theorem(necessarily(X2)))|~(necessitation))&((is_a_theorem(esk34_0)&~(is_a_theorem(necessarily(esk34_0))))|necessitation)),inference(shift_quantors,[status(thm)],[235])).
% fof(237, plain,![X2]:(((~(is_a_theorem(X2))|is_a_theorem(necessarily(X2)))|~(necessitation))&((is_a_theorem(esk34_0)|necessitation)&(~(is_a_theorem(necessarily(esk34_0)))|necessitation))),inference(distribute,[status(thm)],[236])).
% cnf(240,plain,(is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1)),inference(split_conjunct,[status(thm)],[237])).
% fof(328, plain,(~(op_strict_implies)|![X1]:![X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))),inference(fof_nnf,[status(thm)],[62])).
% fof(329, plain,(~(op_strict_implies)|![X3]:![X4]:strict_implies(X3,X4)=necessarily(implies(X3,X4))),inference(variable_rename,[status(thm)],[328])).
% fof(330, plain,![X3]:![X4]:(strict_implies(X3,X4)=necessarily(implies(X3,X4))|~(op_strict_implies)),inference(shift_quantors,[status(thm)],[329])).
% cnf(331,plain,(strict_implies(X1,X2)=necessarily(implies(X1,X2))|~op_strict_implies),inference(split_conjunct,[status(thm)],[330])).
% cnf(465,negated_conjecture,(~axiom_m2),inference(split_conjunct,[status(thm)],[90])).
% cnf(474,plain,(~is_a_theorem(strict_implies(and(esk10_0,esk11_0),esk10_0))),inference(sr,[status(thm)],[122,465,theory(equality)])).
% cnf(475,plain,(is_a_theorem(necessarily(X1))|$false|~is_a_theorem(X1)),inference(rw,[status(thm)],[240,171,theory(equality)])).
% cnf(476,plain,(is_a_theorem(necessarily(X1))|~is_a_theorem(X1)),inference(cn,[status(thm)],[475,theory(equality)])).
% cnf(507,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[184,115,theory(equality)])).
% cnf(508,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[507,theory(equality)])).
% cnf(520,plain,(necessarily(implies(X1,X2))=strict_implies(X1,X2)|$false),inference(rw,[status(thm)],[331,177,theory(equality)])).
% cnf(521,plain,(necessarily(implies(X1,X2))=strict_implies(X1,X2)),inference(cn,[status(thm)],[520,theory(equality)])).
% cnf(522,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[476,521,theory(equality)])).
% cnf(676,plain,(is_a_theorem(strict_implies(and(X1,X2),X1))),inference(spm,[status(thm)],[522,508,theory(equality)])).
% cnf(689,plain,($false),inference(rw,[status(thm)],[474,676,theory(equality)])).
% cnf(690,plain,($false),inference(cn,[status(thm)],[689,theory(equality)])).
% cnf(691,plain,($false),690,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 174
% # ...of these trivial : 29
% # ...subsumed : 1
% # ...remaining for further processing: 144
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 111
% # ...of the previous two non-trivial : 106
% # Contextual simplify-reflections : 0
% # Paramodulations : 111
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 136
% # Positive orientable unit clauses: 55
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 78
% # ...number of literals in the above : 103
% # Clause-clause subsumption calls (NU) : 460
% # Rec. Clause-clause subsumption calls : 457
% # Unit Clause-clause subsumption calls : 189
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 48
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 329 leaves, 1.20+/-0.676 terms/leaf
% # Paramod-from index: 57 leaves, 1.14+/-0.475 terms/leaf
% # Paramod-into index: 282 leaves, 1.11+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.004 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP24867/LCL529+1.tptp
%
%------------------------------------------------------------------------------