TSTP Solution File: LCL536+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL536+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 : art04.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:52:00 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP17531/LCL536+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17531/LCL536+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17531/LCL536+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 17627
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,necessitation,file('/tmp/SRASS.s.p', km5_necessitation)).
% fof(13, axiom,axiom_5,file('/tmp/SRASS.s.p', km5_axiom_5)).
% fof(15, axiom,op_strict_implies,file('/tmp/SRASS.s.p', s1_0_op_strict_implies)).
% fof(16, axiom,(necessitation<=>![X1]:(is_a_theorem(X1)=>is_a_theorem(necessarily(X1)))),file('/tmp/SRASS.s.p', necessitation)).
% fof(18, axiom,(axiom_5<=>![X1]:is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))),file('/tmp/SRASS.s.p', axiom_5)).
% fof(37, axiom,(axiom_m10<=>![X1]:is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))),file('/tmp/SRASS.s.p', axiom_m10)).
% fof(50, axiom,(op_strict_implies=>![X1]:![X4]:strict_implies(X1,X4)=necessarily(implies(X1,X4))),file('/tmp/SRASS.s.p', op_strict_implies)).
% fof(88, conjecture,axiom_m10,file('/tmp/SRASS.s.p', s1_0_m10_axiom_m10)).
% fof(89, negated_conjecture,~(axiom_m10),inference(assume_negation,[status(cth)],[88])).
% fof(90, negated_conjecture,~(axiom_m10),inference(fof_simplification,[status(thm)],[89,theory(equality)])).
% cnf(120,plain,(necessitation),inference(split_conjunct,[status(thm)],[10])).
% cnf(123,plain,(axiom_5),inference(split_conjunct,[status(thm)],[13])).
% cnf(125,plain,(op_strict_implies),inference(split_conjunct,[status(thm)],[15])).
% fof(126, 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)],[16])).
% fof(127, 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)],[126])).
% fof(128, plain,((~(necessitation)|![X2]:(~(is_a_theorem(X2))|is_a_theorem(necessarily(X2))))&((is_a_theorem(esk6_0)&~(is_a_theorem(necessarily(esk6_0))))|necessitation)),inference(skolemize,[status(esa)],[127])).
% fof(129, plain,![X2]:(((~(is_a_theorem(X2))|is_a_theorem(necessarily(X2)))|~(necessitation))&((is_a_theorem(esk6_0)&~(is_a_theorem(necessarily(esk6_0))))|necessitation)),inference(shift_quantors,[status(thm)],[128])).
% fof(130, plain,![X2]:(((~(is_a_theorem(X2))|is_a_theorem(necessarily(X2)))|~(necessitation))&((is_a_theorem(esk6_0)|necessitation)&(~(is_a_theorem(necessarily(esk6_0)))|necessitation))),inference(distribute,[status(thm)],[129])).
% cnf(133,plain,(is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1)),inference(split_conjunct,[status(thm)],[130])).
% fof(140, plain,((~(axiom_5)|![X1]:is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))))&(?[X1]:~(is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))))|axiom_5)),inference(fof_nnf,[status(thm)],[18])).
% fof(141, plain,((~(axiom_5)|![X2]:is_a_theorem(implies(possibly(X2),necessarily(possibly(X2)))))&(?[X3]:~(is_a_theorem(implies(possibly(X3),necessarily(possibly(X3)))))|axiom_5)),inference(variable_rename,[status(thm)],[140])).
% fof(142, plain,((~(axiom_5)|![X2]:is_a_theorem(implies(possibly(X2),necessarily(possibly(X2)))))&(~(is_a_theorem(implies(possibly(esk8_0),necessarily(possibly(esk8_0)))))|axiom_5)),inference(skolemize,[status(esa)],[141])).
% fof(143, plain,![X2]:((is_a_theorem(implies(possibly(X2),necessarily(possibly(X2))))|~(axiom_5))&(~(is_a_theorem(implies(possibly(esk8_0),necessarily(possibly(esk8_0)))))|axiom_5)),inference(shift_quantors,[status(thm)],[142])).
% cnf(145,plain,(is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|~axiom_5),inference(split_conjunct,[status(thm)],[143])).
% fof(187, plain,((~(axiom_m10)|![X1]:is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))))&(?[X1]:~(is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))))|axiom_m10)),inference(fof_nnf,[status(thm)],[37])).
% fof(188, plain,((~(axiom_m10)|![X2]:is_a_theorem(strict_implies(possibly(X2),necessarily(possibly(X2)))))&(?[X3]:~(is_a_theorem(strict_implies(possibly(X3),necessarily(possibly(X3)))))|axiom_m10)),inference(variable_rename,[status(thm)],[187])).
% fof(189, plain,((~(axiom_m10)|![X2]:is_a_theorem(strict_implies(possibly(X2),necessarily(possibly(X2)))))&(~(is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0)))))|axiom_m10)),inference(skolemize,[status(esa)],[188])).
% fof(190, plain,![X2]:((is_a_theorem(strict_implies(possibly(X2),necessarily(possibly(X2))))|~(axiom_m10))&(~(is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0)))))|axiom_m10)),inference(shift_quantors,[status(thm)],[189])).
% cnf(191,plain,(axiom_m10|~is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0))))),inference(split_conjunct,[status(thm)],[190])).
% fof(248, plain,(~(op_strict_implies)|![X1]:![X4]:strict_implies(X1,X4)=necessarily(implies(X1,X4))),inference(fof_nnf,[status(thm)],[50])).
% fof(249, plain,(~(op_strict_implies)|![X5]:![X6]:strict_implies(X5,X6)=necessarily(implies(X5,X6))),inference(variable_rename,[status(thm)],[248])).
% fof(250, plain,![X5]:![X6]:(strict_implies(X5,X6)=necessarily(implies(X5,X6))|~(op_strict_implies)),inference(shift_quantors,[status(thm)],[249])).
% cnf(251,plain,(strict_implies(X1,X2)=necessarily(implies(X1,X2))|~op_strict_implies),inference(split_conjunct,[status(thm)],[250])).
% cnf(465,negated_conjecture,(~axiom_m10),inference(split_conjunct,[status(thm)],[90])).
% cnf(475,plain,(is_a_theorem(necessarily(X1))|$false|~is_a_theorem(X1)),inference(rw,[status(thm)],[133,120,theory(equality)])).
% cnf(476,plain,(is_a_theorem(necessarily(X1))|~is_a_theorem(X1)),inference(cn,[status(thm)],[475,theory(equality)])).
% cnf(477,plain,(~is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0))))),inference(sr,[status(thm)],[191,465,theory(equality)])).
% cnf(520,plain,(necessarily(implies(X1,X2))=strict_implies(X1,X2)|$false),inference(rw,[status(thm)],[251,125,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(530,plain,(is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|$false),inference(rw,[status(thm)],[145,123,theory(equality)])).
% cnf(531,plain,(is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))),inference(cn,[status(thm)],[530,theory(equality)])).
% cnf(674,plain,(is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))),inference(spm,[status(thm)],[522,531,theory(equality)])).
% cnf(697,plain,($false),inference(rw,[status(thm)],[477,674,theory(equality)])).
% cnf(698,plain,($false),inference(cn,[status(thm)],[697,theory(equality)])).
% cnf(699,plain,($false),698,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 180
% # ...of these trivial : 29
% # ...subsumed : 1
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 115
% # ...of the previous two non-trivial : 112
% # Contextual simplify-reflections : 0
% # Paramodulations : 115
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 140
% # Positive orientable unit clauses: 61
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 77
% # Current number of unprocessed clauses: 78
% # ...number of literals in the above : 104
% # Clause-clause subsumption calls (NU) : 425
% # Rec. Clause-clause subsumption calls : 424
% # Unit Clause-clause subsumption calls : 159
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 53
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 330 leaves, 1.20+/-0.677 terms/leaf
% # Paramod-from index: 61 leaves, 1.16+/-0.485 terms/leaf
% # Paramod-into index: 284 leaves, 1.12+/-0.441 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.008 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17531/LCL536+1.tptp
%
%------------------------------------------------------------------------------