TSTP Solution File: LCL531+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL531+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:50:05 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP25126/LCL531+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25126/LCL531+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25126/LCL531+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 25222
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% fof(8, axiom,(axiom_m4<=>![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', axiom_m4)).
% fof(17, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(20, axiom,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% 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(40, axiom,(and_3<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),file('/tmp/SRASS.s.p', and_3)).
% fof(47, axiom,(necessitation<=>![X1]:(is_a_theorem(X1)=>is_a_theorem(necessarily(X1)))),file('/tmp/SRASS.s.p', necessitation)).
% fof(50, axiom,(modus_ponens<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(52, axiom,(implies_2<=>![X1]:![X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),file('/tmp/SRASS.s.p', implies_2)).
% 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_m4,file('/tmp/SRASS.s.p', s1_0_axiom_m4)).
% fof(89, negated_conjecture,~(axiom_m4),inference(assume_negation,[status(cth)],[88])).
% fof(90, negated_conjecture,~(axiom_m4),inference(fof_simplification,[status(thm)],[89,theory(equality)])).
% cnf(117,plain,(and_3),inference(split_conjunct,[status(thm)],[7])).
% fof(118, plain,((~(axiom_m4)|![X1]:is_a_theorem(strict_implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(strict_implies(X1,and(X1,X1))))|axiom_m4)),inference(fof_nnf,[status(thm)],[8])).
% fof(119, plain,((~(axiom_m4)|![X2]:is_a_theorem(strict_implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(strict_implies(X3,and(X3,X3))))|axiom_m4)),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,((~(axiom_m4)|![X2]:is_a_theorem(strict_implies(X2,and(X2,X2))))&(~(is_a_theorem(strict_implies(esk11_0,and(esk11_0,esk11_0))))|axiom_m4)),inference(skolemize,[status(esa)],[119])).
% fof(121, plain,![X2]:((is_a_theorem(strict_implies(X2,and(X2,X2)))|~(axiom_m4))&(~(is_a_theorem(strict_implies(esk11_0,and(esk11_0,esk11_0))))|axiom_m4)),inference(shift_quantors,[status(thm)],[120])).
% cnf(122,plain,(axiom_m4|~is_a_theorem(strict_implies(esk11_0,and(esk11_0,esk11_0)))),inference(split_conjunct,[status(thm)],[121])).
% cnf(158,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[17])).
% cnf(161,plain,(implies_2),inference(split_conjunct,[status(thm)],[20])).
% cnf(171,plain,(necessitation),inference(split_conjunct,[status(thm)],[30])).
% cnf(177,plain,(op_strict_implies),inference(split_conjunct,[status(thm)],[36])).
% fof(191, plain,((~(and_3)|![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))|and_3)),inference(fof_nnf,[status(thm)],[40])).
% fof(192, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(X6,and(X5,X6)))))|and_3)),inference(variable_rename,[status(thm)],[191])).
% fof(193, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(~(is_a_theorem(implies(esk24_0,implies(esk25_0,and(esk24_0,esk25_0)))))|and_3)),inference(skolemize,[status(esa)],[192])).
% fof(194, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(X4,and(X3,X4))))|~(and_3))&(~(is_a_theorem(implies(esk24_0,implies(esk25_0,and(esk24_0,esk25_0)))))|and_3)),inference(shift_quantors,[status(thm)],[193])).
% cnf(196,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[194])).
% 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(253, plain,((~(modus_ponens)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(implies(X1,X2))))|is_a_theorem(X2)))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))&~(is_a_theorem(X2)))|modus_ponens)),inference(fof_nnf,[status(thm)],[50])).
% fof(254, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(implies(X5,X6)))&~(is_a_theorem(X6)))|modus_ponens)),inference(variable_rename,[status(thm)],[253])).
% fof(255, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk37_0)&is_a_theorem(implies(esk37_0,esk38_0)))&~(is_a_theorem(esk38_0)))|modus_ponens)),inference(skolemize,[status(esa)],[254])).
% fof(256, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk37_0)&is_a_theorem(implies(esk37_0,esk38_0)))&~(is_a_theorem(esk38_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[255])).
% fof(257, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk37_0)|modus_ponens)&(is_a_theorem(implies(esk37_0,esk38_0))|modus_ponens))&(~(is_a_theorem(esk38_0))|modus_ponens))),inference(distribute,[status(thm)],[256])).
% cnf(261,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[257])).
% fof(268, plain,((~(implies_2)|![X1]:![X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))|implies_2)),inference(fof_nnf,[status(thm)],[52])).
% fof(269, plain,((~(implies_2)|![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(implies(X5,implies(X5,X6)),implies(X5,X6))))|implies_2)),inference(variable_rename,[status(thm)],[268])).
% fof(270, plain,((~(implies_2)|![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))&(~(is_a_theorem(implies(implies(esk41_0,implies(esk41_0,esk42_0)),implies(esk41_0,esk42_0))))|implies_2)),inference(skolemize,[status(esa)],[269])).
% fof(271, plain,![X3]:![X4]:((is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk41_0,implies(esk41_0,esk42_0)),implies(esk41_0,esk42_0))))|implies_2)),inference(shift_quantors,[status(thm)],[270])).
% cnf(273,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2),inference(split_conjunct,[status(thm)],[271])).
% 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_m4),inference(split_conjunct,[status(thm)],[90])).
% cnf(474,plain,(~is_a_theorem(strict_implies(esk11_0,and(esk11_0,esk11_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(512,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[261,158,theory(equality)])).
% cnf(513,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[512,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(562,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[196,117,theory(equality)])).
% cnf(563,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[562,theory(equality)])).
% cnf(597,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|$false),inference(rw,[status(thm)],[273,161,theory(equality)])).
% cnf(598,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(599,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))),inference(spm,[status(thm)],[513,598,theory(equality)])).
% cnf(914,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(spm,[status(thm)],[599,563,theory(equality)])).
% cnf(933,plain,(is_a_theorem(strict_implies(X1,and(X1,X1)))),inference(spm,[status(thm)],[522,914,theory(equality)])).
% cnf(982,plain,($false),inference(rw,[status(thm)],[474,933,theory(equality)])).
% cnf(983,plain,($false),inference(cn,[status(thm)],[982,theory(equality)])).
% cnf(984,plain,($false),983,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 277
% # ...of these trivial : 30
% # ...subsumed : 26
% # ...remaining for further processing: 221
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 20
% # Generated clauses : 334
% # ...of the previous two non-trivial : 290
% # Contextual simplify-reflections : 2
% # Paramodulations : 334
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 201
% # Positive orientable unit clauses: 85
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 113
% # Current number of unprocessed clauses: 159
% # ...number of literals in the above : 205
% # Clause-clause subsumption calls (NU) : 2061
% # Rec. Clause-clause subsumption calls : 2041
% # Unit Clause-clause subsumption calls : 541
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 161
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 385 leaves, 1.24+/-0.722 terms/leaf
% # Paramod-from index: 81 leaves, 1.21+/-0.490 terms/leaf
% # Paramod-into index: 343 leaves, 1.17+/-0.531 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.007 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP25126/LCL531+1.tptp
%
%------------------------------------------------------------------------------