TSTP Solution File: LCL550+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL550+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:58:28 EST 2010
% Result : Theorem 3.74s
% Output : Solution 3.74s
% 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/SystemOnTPTP5450/LCL550+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5450/LCL550+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5450/LCL550+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 5546
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.03 WC
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,op_strict_implies,file('/tmp/SRASS.s.p', s1_0_op_strict_implies)).
% fof(3, axiom,op_equiv,file('/tmp/SRASS.s.p', s1_0_op_equiv)).
% fof(4, axiom,adjunction,file('/tmp/SRASS.s.p', s1_0_adjunction)).
% fof(5, axiom,axiom_m1,file('/tmp/SRASS.s.p', s1_0_axiom_m1)).
% fof(6, axiom,axiom_m2,file('/tmp/SRASS.s.p', s1_0_axiom_m2)).
% fof(8, axiom,axiom_m4,file('/tmp/SRASS.s.p', s1_0_axiom_m4)).
% fof(9, axiom,axiom_m5,file('/tmp/SRASS.s.p', s1_0_axiom_m5)).
% fof(10, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(12, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(18, axiom,op_or,file('/tmp/SRASS.s.p', s1_0_op_or)).
% fof(19, axiom,op_strict_equiv,file('/tmp/SRASS.s.p', s1_0_op_strict_equiv)).
% fof(20, axiom,modus_ponens_strict_implies,file('/tmp/SRASS.s.p', s1_0_modus_ponens_strict_implies)).
% fof(21, axiom,substitution_strict_equiv,file('/tmp/SRASS.s.p', s1_0_substitution_strict_equiv)).
% fof(24, axiom,(adjunction<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(X2))=>is_a_theorem(and(X1,X2)))),file('/tmp/SRASS.s.p', adjunction)).
% fof(47, axiom,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(48, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(50, axiom,(modus_ponens_strict_implies<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(strict_implies(X1,X2)))=>is_a_theorem(X2))),file('/tmp/SRASS.s.p', modus_ponens_strict_implies)).
% fof(54, axiom,(axiom_m1<=>![X1]:![X2]:is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))),file('/tmp/SRASS.s.p', axiom_m1)).
% fof(55, axiom,(axiom_m2<=>![X1]:![X2]:is_a_theorem(strict_implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', axiom_m2)).
% fof(57, axiom,(axiom_m4<=>![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', axiom_m4)).
% fof(58, axiom,(axiom_m5<=>![X1]:![X2]:![X3]:is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))),file('/tmp/SRASS.s.p', axiom_m5)).
% fof(59, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(60, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(63, axiom,(op_strict_implies=>![X1]:![X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))),file('/tmp/SRASS.s.p', op_strict_implies)).
% fof(66, axiom,(substitution_strict_equiv<=>![X1]:![X2]:(is_a_theorem(strict_equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_strict_equiv)).
% fof(75, axiom,(op_strict_equiv=>![X1]:![X2]:strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))),file('/tmp/SRASS.s.p', op_strict_equiv)).
% fof(77, conjecture,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(78, negated_conjecture,~(modus_ponens),inference(assume_negation,[status(cth)],[77])).
% fof(79, negated_conjecture,~(modus_ponens),inference(fof_simplification,[status(thm)],[78,theory(equality)])).
% fof(80, 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)],[1])).
% fof(81, 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)],[80])).
% fof(82, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk1_0)&is_a_theorem(implies(esk1_0,esk2_0)))&~(is_a_theorem(esk2_0)))|modus_ponens)),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk1_0)&is_a_theorem(implies(esk1_0,esk2_0)))&~(is_a_theorem(esk2_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[82])).
% fof(84, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk1_0)|modus_ponens)&(is_a_theorem(implies(esk1_0,esk2_0))|modus_ponens))&(~(is_a_theorem(esk2_0))|modus_ponens))),inference(distribute,[status(thm)],[83])).
% cnf(85,plain,(modus_ponens|~is_a_theorem(esk2_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(86,plain,(modus_ponens|is_a_theorem(implies(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,plain,(modus_ponens|is_a_theorem(esk1_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(89,plain,(op_strict_implies),inference(split_conjunct,[status(thm)],[2])).
% cnf(90,plain,(op_equiv),inference(split_conjunct,[status(thm)],[3])).
% cnf(91,plain,(adjunction),inference(split_conjunct,[status(thm)],[4])).
% cnf(92,plain,(axiom_m1),inference(split_conjunct,[status(thm)],[5])).
% cnf(93,plain,(axiom_m2),inference(split_conjunct,[status(thm)],[6])).
% cnf(95,plain,(axiom_m4),inference(split_conjunct,[status(thm)],[8])).
% cnf(96,plain,(axiom_m5),inference(split_conjunct,[status(thm)],[9])).
% cnf(97,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[10])).
% cnf(99,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[12])).
% cnf(125,plain,(op_or),inference(split_conjunct,[status(thm)],[18])).
% cnf(126,plain,(op_strict_equiv),inference(split_conjunct,[status(thm)],[19])).
% cnf(127,plain,(modus_ponens_strict_implies),inference(split_conjunct,[status(thm)],[20])).
% cnf(128,plain,(substitution_strict_equiv),inference(split_conjunct,[status(thm)],[21])).
% fof(138, plain,((~(adjunction)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(X2)))|is_a_theorem(and(X1,X2))))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(X2))&~(is_a_theorem(and(X1,X2))))|adjunction)),inference(fof_nnf,[status(thm)],[24])).
% fof(139, plain,((~(adjunction)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4))))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(X6))&~(is_a_theorem(and(X5,X6))))|adjunction)),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,((~(adjunction)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4))))&(((is_a_theorem(esk14_0)&is_a_theorem(esk15_0))&~(is_a_theorem(and(esk14_0,esk15_0))))|adjunction)),inference(skolemize,[status(esa)],[139])).
% fof(141, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4)))|~(adjunction))&(((is_a_theorem(esk14_0)&is_a_theorem(esk15_0))&~(is_a_theorem(and(esk14_0,esk15_0))))|adjunction)),inference(shift_quantors,[status(thm)],[140])).
% fof(142, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4)))|~(adjunction))&(((is_a_theorem(esk14_0)|adjunction)&(is_a_theorem(esk15_0)|adjunction))&(~(is_a_theorem(and(esk14_0,esk15_0)))|adjunction))),inference(distribute,[status(thm)],[141])).
% cnf(146,plain,(is_a_theorem(and(X1,X2))|~adjunction|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(split_conjunct,[status(thm)],[142])).
% fof(279, plain,((~(substitution_of_equivalents)|![X1]:![X2]:(~(is_a_theorem(equiv(X1,X2)))|X1=X2))&(?[X1]:?[X2]:(is_a_theorem(equiv(X1,X2))&~(X1=X2))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[47])).
% fof(280, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&(?[X5]:?[X6]:(is_a_theorem(equiv(X5,X6))&~(X5=X6))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[279])).
% fof(281, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk58_0,esk59_0))&~(esk58_0=esk59_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[280])).
% fof(282, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk58_0,esk59_0))&~(esk58_0=esk59_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[281])).
% fof(283, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk58_0,esk59_0))|substitution_of_equivalents)&(~(esk58_0=esk59_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[282])).
% cnf(286,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[283])).
% fof(287, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[48])).
% fof(288, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[287])).
% fof(289, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[288])).
% cnf(290,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[289])).
% fof(295, plain,((~(modus_ponens_strict_implies)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(strict_implies(X1,X2))))|is_a_theorem(X2)))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(strict_implies(X1,X2)))&~(is_a_theorem(X2)))|modus_ponens_strict_implies)),inference(fof_nnf,[status(thm)],[50])).
% fof(296, plain,((~(modus_ponens_strict_implies)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(strict_implies(X3,X4))))|is_a_theorem(X4)))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(strict_implies(X5,X6)))&~(is_a_theorem(X6)))|modus_ponens_strict_implies)),inference(variable_rename,[status(thm)],[295])).
% fof(297, plain,((~(modus_ponens_strict_implies)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(strict_implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk60_0)&is_a_theorem(strict_implies(esk60_0,esk61_0)))&~(is_a_theorem(esk61_0)))|modus_ponens_strict_implies)),inference(skolemize,[status(esa)],[296])).
% fof(298, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(strict_implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens_strict_implies))&(((is_a_theorem(esk60_0)&is_a_theorem(strict_implies(esk60_0,esk61_0)))&~(is_a_theorem(esk61_0)))|modus_ponens_strict_implies)),inference(shift_quantors,[status(thm)],[297])).
% fof(299, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(strict_implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens_strict_implies))&(((is_a_theorem(esk60_0)|modus_ponens_strict_implies)&(is_a_theorem(strict_implies(esk60_0,esk61_0))|modus_ponens_strict_implies))&(~(is_a_theorem(esk61_0))|modus_ponens_strict_implies))),inference(distribute,[status(thm)],[298])).
% cnf(303,plain,(is_a_theorem(X1)|~modus_ponens_strict_implies|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[299])).
% fof(322, plain,((~(axiom_m1)|![X1]:![X2]:is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))))&(?[X1]:?[X2]:~(is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))))|axiom_m1)),inference(fof_nnf,[status(thm)],[54])).
% fof(323, plain,((~(axiom_m1)|![X3]:![X4]:is_a_theorem(strict_implies(and(X3,X4),and(X4,X3))))&(?[X5]:?[X6]:~(is_a_theorem(strict_implies(and(X5,X6),and(X6,X5))))|axiom_m1)),inference(variable_rename,[status(thm)],[322])).
% fof(324, plain,((~(axiom_m1)|![X3]:![X4]:is_a_theorem(strict_implies(and(X3,X4),and(X4,X3))))&(~(is_a_theorem(strict_implies(and(esk69_0,esk70_0),and(esk70_0,esk69_0))))|axiom_m1)),inference(skolemize,[status(esa)],[323])).
% fof(325, plain,![X3]:![X4]:((is_a_theorem(strict_implies(and(X3,X4),and(X4,X3)))|~(axiom_m1))&(~(is_a_theorem(strict_implies(and(esk69_0,esk70_0),and(esk70_0,esk69_0))))|axiom_m1)),inference(shift_quantors,[status(thm)],[324])).
% cnf(327,plain,(is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1),inference(split_conjunct,[status(thm)],[325])).
% fof(328, 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)],[55])).
% fof(329, 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)],[328])).
% fof(330, plain,((~(axiom_m2)|![X3]:![X4]:is_a_theorem(strict_implies(and(X3,X4),X3)))&(~(is_a_theorem(strict_implies(and(esk71_0,esk72_0),esk71_0)))|axiom_m2)),inference(skolemize,[status(esa)],[329])).
% fof(331, plain,![X3]:![X4]:((is_a_theorem(strict_implies(and(X3,X4),X3))|~(axiom_m2))&(~(is_a_theorem(strict_implies(and(esk71_0,esk72_0),esk71_0)))|axiom_m2)),inference(shift_quantors,[status(thm)],[330])).
% cnf(333,plain,(is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2),inference(split_conjunct,[status(thm)],[331])).
% fof(340, 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)],[57])).
% fof(341, 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)],[340])).
% fof(342, plain,((~(axiom_m4)|![X2]:is_a_theorem(strict_implies(X2,and(X2,X2))))&(~(is_a_theorem(strict_implies(esk76_0,and(esk76_0,esk76_0))))|axiom_m4)),inference(skolemize,[status(esa)],[341])).
% fof(343, plain,![X2]:((is_a_theorem(strict_implies(X2,and(X2,X2)))|~(axiom_m4))&(~(is_a_theorem(strict_implies(esk76_0,and(esk76_0,esk76_0))))|axiom_m4)),inference(shift_quantors,[status(thm)],[342])).
% cnf(345,plain,(is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4),inference(split_conjunct,[status(thm)],[343])).
% fof(346, plain,((~(axiom_m5)|![X1]:![X2]:![X3]:is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))))|axiom_m5)),inference(fof_nnf,[status(thm)],[58])).
% fof(347, plain,((~(axiom_m5)|![X4]:![X5]:![X6]:is_a_theorem(strict_implies(and(strict_implies(X4,X5),strict_implies(X5,X6)),strict_implies(X4,X6))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(strict_implies(and(strict_implies(X7,X8),strict_implies(X8,X9)),strict_implies(X7,X9))))|axiom_m5)),inference(variable_rename,[status(thm)],[346])).
% fof(348, plain,((~(axiom_m5)|![X4]:![X5]:![X6]:is_a_theorem(strict_implies(and(strict_implies(X4,X5),strict_implies(X5,X6)),strict_implies(X4,X6))))&(~(is_a_theorem(strict_implies(and(strict_implies(esk77_0,esk78_0),strict_implies(esk78_0,esk79_0)),strict_implies(esk77_0,esk79_0))))|axiom_m5)),inference(skolemize,[status(esa)],[347])).
% fof(349, plain,![X4]:![X5]:![X6]:((is_a_theorem(strict_implies(and(strict_implies(X4,X5),strict_implies(X5,X6)),strict_implies(X4,X6)))|~(axiom_m5))&(~(is_a_theorem(strict_implies(and(strict_implies(esk77_0,esk78_0),strict_implies(esk78_0,esk79_0)),strict_implies(esk77_0,esk79_0))))|axiom_m5)),inference(shift_quantors,[status(thm)],[348])).
% cnf(351,plain,(is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_m5),inference(split_conjunct,[status(thm)],[349])).
% fof(352, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[59])).
% fof(353, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[352])).
% fof(354, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[353])).
% cnf(355,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[354])).
% fof(356, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[60])).
% fof(357, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[356])).
% fof(358, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[357])).
% cnf(359,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[358])).
% fof(372, plain,(~(op_strict_implies)|![X1]:![X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))),inference(fof_nnf,[status(thm)],[63])).
% fof(373, plain,(~(op_strict_implies)|![X3]:![X4]:strict_implies(X3,X4)=necessarily(implies(X3,X4))),inference(variable_rename,[status(thm)],[372])).
% fof(374, plain,![X3]:![X4]:(strict_implies(X3,X4)=necessarily(implies(X3,X4))|~(op_strict_implies)),inference(shift_quantors,[status(thm)],[373])).
% cnf(375,plain,(strict_implies(X1,X2)=necessarily(implies(X1,X2))|~op_strict_implies),inference(split_conjunct,[status(thm)],[374])).
% fof(386, plain,((~(substitution_strict_equiv)|![X1]:![X2]:(~(is_a_theorem(strict_equiv(X1,X2)))|X1=X2))&(?[X1]:?[X2]:(is_a_theorem(strict_equiv(X1,X2))&~(X1=X2))|substitution_strict_equiv)),inference(fof_nnf,[status(thm)],[66])).
% fof(387, plain,((~(substitution_strict_equiv)|![X3]:![X4]:(~(is_a_theorem(strict_equiv(X3,X4)))|X3=X4))&(?[X5]:?[X6]:(is_a_theorem(strict_equiv(X5,X6))&~(X5=X6))|substitution_strict_equiv)),inference(variable_rename,[status(thm)],[386])).
% fof(388, plain,((~(substitution_strict_equiv)|![X3]:![X4]:(~(is_a_theorem(strict_equiv(X3,X4)))|X3=X4))&((is_a_theorem(strict_equiv(esk84_0,esk85_0))&~(esk84_0=esk85_0))|substitution_strict_equiv)),inference(skolemize,[status(esa)],[387])).
% fof(389, plain,![X3]:![X4]:(((~(is_a_theorem(strict_equiv(X3,X4)))|X3=X4)|~(substitution_strict_equiv))&((is_a_theorem(strict_equiv(esk84_0,esk85_0))&~(esk84_0=esk85_0))|substitution_strict_equiv)),inference(shift_quantors,[status(thm)],[388])).
% fof(390, plain,![X3]:![X4]:(((~(is_a_theorem(strict_equiv(X3,X4)))|X3=X4)|~(substitution_strict_equiv))&((is_a_theorem(strict_equiv(esk84_0,esk85_0))|substitution_strict_equiv)&(~(esk84_0=esk85_0)|substitution_strict_equiv))),inference(distribute,[status(thm)],[389])).
% cnf(393,plain,(X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2))),inference(split_conjunct,[status(thm)],[390])).
% fof(438, plain,(~(op_strict_equiv)|![X1]:![X2]:strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))),inference(fof_nnf,[status(thm)],[75])).
% fof(439, plain,(~(op_strict_equiv)|![X3]:![X4]:strict_equiv(X3,X4)=and(strict_implies(X3,X4),strict_implies(X4,X3))),inference(variable_rename,[status(thm)],[438])).
% fof(440, plain,![X3]:![X4]:(strict_equiv(X3,X4)=and(strict_implies(X3,X4),strict_implies(X4,X3))|~(op_strict_equiv)),inference(shift_quantors,[status(thm)],[439])).
% cnf(441,plain,(strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))|~op_strict_equiv),inference(split_conjunct,[status(thm)],[440])).
% cnf(443,negated_conjecture,(~modus_ponens),inference(split_conjunct,[status(thm)],[79])).
% cnf(446,plain,(~is_a_theorem(esk2_0)),inference(sr,[status(thm)],[85,443,theory(equality)])).
% cnf(447,plain,(is_a_theorem(esk1_0)),inference(sr,[status(thm)],[87,443,theory(equality)])).
% cnf(455,plain,(is_a_theorem(implies(esk1_0,esk2_0))),inference(sr,[status(thm)],[86,443,theory(equality)])).
% cnf(461,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[286,99,theory(equality)])).
% cnf(462,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[461,theory(equality)])).
% cnf(463,plain,(X1=X2|$false|~is_a_theorem(strict_equiv(X1,X2))),inference(rw,[status(thm)],[393,128,theory(equality)])).
% cnf(464,plain,(X1=X2|~is_a_theorem(strict_equiv(X1,X2))),inference(cn,[status(thm)],[463,theory(equality)])).
% cnf(469,plain,(is_a_theorem(strict_implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[345,95,theory(equality)])).
% cnf(470,plain,(is_a_theorem(strict_implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[469,theory(equality)])).
% cnf(471,plain,(is_a_theorem(strict_implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[333,93,theory(equality)])).
% cnf(472,plain,(is_a_theorem(strict_implies(and(X1,X2),X1))),inference(cn,[status(thm)],[471,theory(equality)])).
% cnf(473,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(strict_implies(X2,X1))),inference(rw,[status(thm)],[303,127,theory(equality)])).
% cnf(474,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(strict_implies(X2,X1))),inference(cn,[status(thm)],[473,theory(equality)])).
% cnf(475,plain,(is_a_theorem(X1)|~is_a_theorem(and(X1,X2))),inference(spm,[status(thm)],[474,472,theory(equality)])).
% cnf(477,plain,(is_a_theorem(and(X1,X2))|$false|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(rw,[status(thm)],[146,91,theory(equality)])).
% cnf(478,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(cn,[status(thm)],[477,theory(equality)])).
% cnf(479,plain,(necessarily(implies(X1,X2))=strict_implies(X1,X2)|$false),inference(rw,[status(thm)],[375,89,theory(equality)])).
% cnf(480,plain,(necessarily(implies(X1,X2))=strict_implies(X1,X2)),inference(cn,[status(thm)],[479,theory(equality)])).
% cnf(481,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[355,97,theory(equality)])).
% cnf(482,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[481,theory(equality)])).
% cnf(484,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[482,482,theory(equality)])).
% cnf(488,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[290,482,theory(equality)])).
% cnf(489,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[488,125,theory(equality)])).
% cnf(490,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[489,theory(equality)])).
% cnf(491,plain,(necessarily(or(X1,X2))=strict_implies(not(X1),X2)),inference(spm,[status(thm)],[480,490,theory(equality)])).
% cnf(492,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[490,482,theory(equality)])).
% cnf(499,plain,(is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|$false),inference(rw,[status(thm)],[327,92,theory(equality)])).
% cnf(500,plain,(is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))),inference(cn,[status(thm)],[499,theory(equality)])).
% cnf(505,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[359,90,theory(equality)])).
% cnf(506,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[505,theory(equality)])).
% cnf(507,plain,(X1=X2|~is_a_theorem(and(implies(X1,X2),implies(X2,X1)))),inference(spm,[status(thm)],[462,506,theory(equality)])).
% cnf(518,plain,(and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)|$false),inference(rw,[status(thm)],[441,126,theory(equality)])).
% cnf(519,plain,(and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)),inference(cn,[status(thm)],[518,theory(equality)])).
% cnf(520,plain,(is_a_theorem(strict_equiv(X1,X2))|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(strict_implies(X1,X2))),inference(spm,[status(thm)],[478,519,theory(equality)])).
% cnf(537,plain,(is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|$false),inference(rw,[status(thm)],[351,96,theory(equality)])).
% cnf(538,plain,(is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))),inference(cn,[status(thm)],[537,theory(equality)])).
% cnf(539,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(and(strict_implies(X1,X3),strict_implies(X3,X2)))),inference(spm,[status(thm)],[474,538,theory(equality)])).
% cnf(543,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_equiv(X1,X2))),inference(spm,[status(thm)],[475,519,theory(equality)])).
% cnf(565,plain,(X1=X2|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[507,478,theory(equality)])).
% cnf(567,plain,(esk2_0=esk1_0|~is_a_theorem(implies(esk2_0,esk1_0))),inference(spm,[status(thm)],[565,455,theory(equality)])).
% cnf(596,plain,(is_a_theorem(strict_equiv(and(X1,X2),and(X2,X1)))|~is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))),inference(spm,[status(thm)],[520,500,theory(equality)])).
% cnf(599,plain,(is_a_theorem(strict_equiv(and(X1,X1),X1))|~is_a_theorem(strict_implies(and(X1,X1),X1))),inference(spm,[status(thm)],[520,470,theory(equality)])).
% cnf(600,plain,(is_a_theorem(strict_equiv(and(X1,X2),and(X2,X1)))|$false),inference(rw,[status(thm)],[596,500,theory(equality)])).
% cnf(601,plain,(is_a_theorem(strict_equiv(and(X1,X2),and(X2,X1)))),inference(cn,[status(thm)],[600,theory(equality)])).
% cnf(602,plain,(is_a_theorem(strict_equiv(and(X1,X1),X1))|$false),inference(rw,[status(thm)],[599,472,theory(equality)])).
% cnf(603,plain,(is_a_theorem(strict_equiv(and(X1,X1),X1))),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(604,plain,(and(X1,X1)=X1),inference(spm,[status(thm)],[464,603,theory(equality)])).
% cnf(620,plain,(strict_implies(X1,X1)=strict_equiv(X1,X1)),inference(spm,[status(thm)],[519,604,theory(equality)])).
% cnf(625,plain,(not(not(X1))=implies(not(X1),X1)),inference(spm,[status(thm)],[482,604,theory(equality)])).
% cnf(627,plain,(not(implies(X1,X2))=implies(implies(X1,X2),and(X1,not(X2)))),inference(spm,[status(thm)],[484,604,theory(equality)])).
% cnf(636,plain,(is_a_theorem(strict_equiv(X1,X1))),inference(rw,[status(thm)],[603,604,theory(equality)])).
% cnf(642,plain,(not(not(X1))=or(X1,X1)),inference(rw,[status(thm)],[625,490,theory(equality)])).
% cnf(647,plain,(is_a_theorem(strict_implies(X1,X1))),inference(spm,[status(thm)],[543,636,theory(equality)])).
% cnf(685,plain,(and(X1,X2)=and(X2,X1)),inference(spm,[status(thm)],[464,601,theory(equality)])).
% cnf(702,plain,(and(strict_implies(X2,X1),strict_implies(X1,X2))=strict_equiv(X1,X2)),inference(spm,[status(thm)],[519,685,theory(equality)])).
% cnf(709,plain,(not(and(not(X2),X1))=implies(X1,X2)),inference(spm,[status(thm)],[482,685,theory(equality)])).
% cnf(713,plain,(is_a_theorem(X1)|~is_a_theorem(and(X2,X1))),inference(spm,[status(thm)],[475,685,theory(equality)])).
% cnf(714,plain,(is_a_theorem(strict_implies(and(X2,X1),X1))),inference(spm,[status(thm)],[472,685,theory(equality)])).
% cnf(747,plain,(strict_equiv(X2,X1)=strict_equiv(X1,X2)),inference(rw,[status(thm)],[702,519,theory(equality)])).
% cnf(853,plain,(implies(not(X2),X1)=implies(not(X1),X2)),inference(spm,[status(thm)],[482,709,theory(equality)])).
% cnf(869,plain,(or(X2,X1)=implies(not(X1),X2)),inference(rw,[status(thm)],[853,490,theory(equality)])).
% cnf(870,plain,(or(X2,X1)=or(X1,X2)),inference(rw,[status(thm)],[869,490,theory(equality)])).
% cnf(879,plain,(necessarily(or(X2,X1))=strict_implies(not(X1),X2)),inference(spm,[status(thm)],[491,870,theory(equality)])).
% cnf(893,plain,(strict_implies(not(X2),X1)=strict_implies(not(X1),X2)),inference(rw,[status(thm)],[879,491,theory(equality)])).
% cnf(1070,plain,(and(strict_implies(not(X2),X1),strict_implies(X2,not(X1)))=strict_equiv(not(X1),X2)),inference(spm,[status(thm)],[519,893,theory(equality)])).
% cnf(1089,plain,(strict_implies(not(X1),not(X2))=strict_implies(or(X2,X2),X1)),inference(spm,[status(thm)],[893,642,theory(equality)])).
% cnf(1803,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X3,X2))|~is_a_theorem(strict_implies(X1,X3))),inference(spm,[status(thm)],[539,478,theory(equality)])).
% cnf(16643,plain,(and(strict_implies(X2,not(X1)),strict_implies(not(X2),X1))=strict_equiv(not(X1),X2)),inference(rw,[status(thm)],[1070,685,theory(equality)])).
% cnf(16670,plain,(is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_equiv(not(X2),X1))),inference(spm,[status(thm)],[713,16643,theory(equality)])).
% cnf(16805,plain,(is_a_theorem(strict_implies(not(X1),not(X2)))|~is_a_theorem(strict_equiv(or(X2,X2),X1))),inference(spm,[status(thm)],[16670,642,theory(equality)])).
% cnf(17493,plain,(is_a_theorem(strict_implies(not(or(X1,X1)),not(X1)))|~is_a_theorem(strict_implies(or(X1,X1),or(X1,X1)))),inference(spm,[status(thm)],[16805,620,theory(equality)])).
% cnf(17531,plain,(is_a_theorem(strict_implies(not(or(X1,X1)),not(X1)))|$false),inference(rw,[status(thm)],[17493,647,theory(equality)])).
% cnf(17532,plain,(is_a_theorem(strict_implies(not(or(X1,X1)),not(X1)))),inference(cn,[status(thm)],[17531,theory(equality)])).
% cnf(17533,plain,(is_a_theorem(strict_implies(not(not(X1)),or(X1,X1)))),inference(rw,[status(thm)],[17532,893,theory(equality)])).
% cnf(17711,plain,(is_a_theorem(strict_implies(or(X1,X1),X1))),inference(spm,[status(thm)],[647,1089,theory(equality)])).
% cnf(17851,plain,(is_a_theorem(strict_equiv(X1,or(X1,X1)))|~is_a_theorem(strict_implies(X1,or(X1,X1)))),inference(spm,[status(thm)],[520,17711,theory(equality)])).
% cnf(39814,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,or(X2,X2)))),inference(spm,[status(thm)],[1803,17711,theory(equality)])).
% cnf(39869,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,and(X3,X2)))),inference(spm,[status(thm)],[1803,714,theory(equality)])).
% cnf(39899,plain,(is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,not(not(X2))))),inference(spm,[status(thm)],[39814,642,theory(equality)])).
% cnf(39912,plain,(is_a_theorem(strict_implies(or(or(X1,X1),or(X1,X1)),X1))),inference(spm,[status(thm)],[39814,17711,theory(equality)])).
% cnf(40746,plain,(is_a_theorem(strict_implies(not(X1),not(or(X1,X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[39912,642,theory(equality)]),893,theory(equality)])).
% cnf(40748,plain,(is_a_theorem(strict_equiv(not(or(X1,X1)),not(X1)))|~is_a_theorem(strict_implies(not(or(X1,X1)),not(X1)))),inference(spm,[status(thm)],[520,40746,theory(equality)])).
% cnf(40802,plain,(is_a_theorem(strict_equiv(not(or(X1,X1)),not(X1)))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[40748,893,theory(equality)]),17533,theory(equality)])).
% cnf(40803,plain,(is_a_theorem(strict_equiv(not(or(X1,X1)),not(X1)))),inference(cn,[status(thm)],[40802,theory(equality)])).
% cnf(40838,plain,(is_a_theorem(strict_equiv(not(X1),not(or(X1,X1))))),inference(rw,[status(thm)],[40803,747,theory(equality)])).
% cnf(40839,plain,(not(X1)=not(or(X1,X1))),inference(spm,[status(thm)],[464,40838,theory(equality)])).
% cnf(40949,plain,(not(and(not(X1),X2))=implies(X2,or(X1,X1))),inference(spm,[status(thm)],[709,40839,theory(equality)])).
% cnf(41298,plain,(implies(X2,X1)=implies(X2,or(X1,X1))),inference(rw,[status(thm)],[40949,709,theory(equality)])).
% cnf(44293,plain,(is_a_theorem(strict_implies(or(and(X1,X2),and(X1,X2)),X2))),inference(spm,[status(thm)],[39869,17711,theory(equality)])).
% cnf(45259,plain,(is_a_theorem(strict_implies(or(and(X1,not(not(X2))),and(X1,not(not(X2)))),X2))),inference(spm,[status(thm)],[39899,44293,theory(equality)])).
% cnf(45295,plain,(is_a_theorem(strict_implies(not(implies(X1,not(X2))),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[45259,492,theory(equality)]),627,theory(equality)])).
% cnf(45299,plain,(is_a_theorem(strict_implies(not(X2),implies(X1,not(X2))))),inference(rw,[status(thm)],[45295,893,theory(equality)])).
% cnf(45300,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[474,45299,theory(equality)])).
% cnf(62770,plain,(necessarily(implies(X1,X2))=strict_implies(X1,or(X2,X2))),inference(spm,[status(thm)],[480,41298,theory(equality)])).
% cnf(62926,plain,(strict_implies(X1,X2)=strict_implies(X1,or(X2,X2))),inference(rw,[status(thm)],[62770,480,theory(equality)])).
% cnf(65297,plain,(is_a_theorem(strict_equiv(X1,or(X1,X1)))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17851,62926,theory(equality)]),647,theory(equality)])).
% cnf(65298,plain,(is_a_theorem(strict_equiv(X1,or(X1,X1)))),inference(cn,[status(thm)],[65297,theory(equality)])).
% cnf(65467,plain,(X1=or(X1,X1)),inference(spm,[status(thm)],[464,65298,theory(equality)])).
% cnf(65685,plain,(not(not(X1))=X1),inference(rw,[status(thm)],[642,65467,theory(equality)])).
% cnf(65972,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[45300,65685,theory(equality)])).
% cnf(66290,plain,(esk2_0=esk1_0|~is_a_theorem(esk1_0)),inference(spm,[status(thm)],[567,65972,theory(equality)])).
% cnf(66347,plain,(esk2_0=esk1_0|$false),inference(rw,[status(thm)],[66290,447,theory(equality)])).
% cnf(66348,plain,(esk2_0=esk1_0),inference(cn,[status(thm)],[66347,theory(equality)])).
% cnf(66374,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[446,66348,theory(equality)]),447,theory(equality)])).
% cnf(66375,plain,($false),inference(cn,[status(thm)],[66374,theory(equality)])).
% cnf(66376,plain,($false),66375,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5805
% # ...of these trivial : 301
% # ...subsumed : 4480
% # ...remaining for further processing: 1024
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 43
% # Backward-rewritten : 277
% # Generated clauses : 45920
% # ...of the previous two non-trivial : 41960
% # Contextual simplify-reflections : 366
% # Paramodulations : 45920
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 704
% # Positive orientable unit clauses: 235
% # Positive unorientable unit clauses: 16
% # Negative unit clauses : 1
% # Non-unit-clauses : 452
% # Current number of unprocessed clauses: 19187
% # ...number of literals in the above : 31674
% # Clause-clause subsumption calls (NU) : 70997
% # Rec. Clause-clause subsumption calls : 70946
% # Unit Clause-clause subsumption calls : 530
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4344
% # Indexed BW rewrite successes : 292
% # Backwards rewriting index: 826 leaves, 2.28+/-4.568 terms/leaf
% # Paramod-from index: 142 leaves, 1.89+/-4.007 terms/leaf
% # Paramod-into index: 718 leaves, 2.19+/-4.791 terms/leaf
% # -------------------------------------------------
% # User time : 1.544 s
% # System time : 0.058 s
% # Total time : 1.602 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.61 CPU 2.85 WC
% FINAL PrfWatch: 2.61 CPU 2.85 WC
% SZS output end Solution for /tmp/SystemOnTPTP5450/LCL550+1.tptp
%
%------------------------------------------------------------------------------