TSTP Solution File: LCL535+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL535+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:25:12 EDT 2023
% Result : Theorem 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 36
% Syntax : Number of formulae : 162 ( 84 unt; 0 def)
% Number of atoms : 292 ( 62 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 218 ( 88 ~; 89 |; 19 &)
% ( 14 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 20 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 24 con; 0-2 aty)
% Number of variables : 204 ( 15 sgn; 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',and_3) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',substitution_of_equivalents) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',op_equiv) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_and_3) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',substitution_of_equivalents) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_op_equiv) ).
fof(implies_1,axiom,
( implies_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',implies_1) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',implies_2) ).
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',necessitation) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',op_strict_implies) ).
fof(hilbert_implies_1,axiom,
implies_1,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_implies_1) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_implies_2) ).
fof(km5_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',km5_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',s1_0_op_strict_implies) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',and_1) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',axiom_m4) ).
fof(axiom_m2,axiom,
( axiom_m2
<=> ! [X1,X2] : is_a_theorem(strict_implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',axiom_m2) ).
fof(hilbert_and_1,axiom,
and_1,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_and_1) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',axiom_M) ).
fof(km5_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',km5_axiom_M) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_op_implies_and) ).
fof(or_3,axiom,
( or_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X3),implies(implies(X2,X3),implies(or(X1,X2),X3)))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',or_3) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_op_or) ).
fof(and_2,axiom,
( and_2
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',and_2) ).
fof(hilbert_or_3,axiom,
or_3,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_or_3) ).
fof(hilbert_and_2,axiom,
and_2,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',hilbert_and_2) ).
fof(op_possibly,axiom,
( op_possibly
=> ! [X1] : possibly(X1) = not(necessarily(not(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',op_possibly) ).
fof(km5_op_possibly,axiom,
op_possibly,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',km5_op_possibly) ).
fof(axiom_5,axiom,
( axiom_5
<=> ! [X1] : is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',axiom_5) ).
fof(km5_axiom_5,axiom,
axiom_5,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',km5_axiom_5) ).
fof(axiom_m9,axiom,
( axiom_m9
<=> ! [X1] : is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',axiom_m9) ).
fof(s1_0_m6s3m9b_axiom_m9,conjecture,
axiom_m9,
file('/export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p',s1_0_m6s3m9b_axiom_m9) ).
fof(c_0_36,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( 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)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_37,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])]) ).
fof(c_0_38,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
fof(c_0_39,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_40,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_44,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_46,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_48,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
fof(c_0_50,plain,
! [X19,X20] :
( ( ~ implies_1
| is_a_theorem(implies(X19,implies(X20,X19))) )
& ( ~ is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))
| implies_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_1])])])]) ).
fof(c_0_51,plain,
! [X23,X24] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])]) ).
fof(c_0_52,plain,
! [X127] :
( ( ~ necessitation
| ~ is_a_theorem(X127)
| is_a_theorem(necessarily(X127)) )
& ( is_a_theorem(esk56_0)
| necessitation )
& ( ~ is_a_theorem(necessarily(esk56_0))
| necessitation ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessitation])])])])]) ).
fof(c_0_53,plain,
! [X207,X208] :
( ~ op_strict_implies
| strict_implies(X207,X208) = necessarily(implies(X207,X208)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])]) ).
cnf(c_0_54,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_55,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ implies_1 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
implies_1,
inference(split_conjunct,[status(thm)],[hilbert_implies_1]) ).
cnf(c_0_59,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
cnf(c_0_61,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_63,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_64,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_65,plain,
! [X33,X34] :
( ( ~ and_1
| is_a_theorem(implies(and(X33,X34),X33)) )
& ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])]) ).
cnf(c_0_66,plain,
( X1 = X2
| ~ is_a_theorem(and(implies(X1,X2),implies(X2,X1))) ),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_67,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_56]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
fof(c_0_69,plain,
! [X183] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X183,and(X183,X183))) )
& ( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
fof(c_0_71,plain,
! [X173,X174] :
( ( ~ axiom_m2
| is_a_theorem(strict_implies(and(X173,X174),X173)) )
& ( ~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0))
| axiom_m2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m2])])])]) ).
cnf(c_0_72,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_73,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_74,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,plain,
and_1,
inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).
fof(c_0_76,plain,
! [X145] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X145),X145)) )
& ( ~ is_a_theorem(implies(necessarily(esk65_0),esk65_0))
| axiom_M ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_M])])])]) ).
cnf(c_0_77,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_78,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_68]) ).
cnf(c_0_79,plain,
( is_a_theorem(strict_implies(X1,and(X1,X1)))
| ~ axiom_m4 ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_80,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_81,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_48,c_0_70]) ).
cnf(c_0_82,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0)) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_83,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_84,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_85,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_86,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km5_axiom_M]) ).
fof(c_0_87,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
cnf(c_0_88,plain,
( X1 = X2
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_89,plain,
( is_a_theorem(strict_implies(X1,and(X1,X1)))
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_90,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_81,c_0_49]) ).
cnf(c_0_91,plain,
( is_a_theorem(strict_implies(and(X1,X2),X1))
| ~ axiom_m2 ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_92,plain,
axiom_m2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_93,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
fof(c_0_94,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_95,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_96,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_97,plain,
( implies(X1,X2) = X2
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_88,c_0_68]) ).
cnf(c_0_98,plain,
is_a_theorem(strict_implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_83]),c_0_90])]) ).
cnf(c_0_99,plain,
and(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_90]),c_0_84])]) ).
cnf(c_0_100,plain,
is_a_theorem(strict_implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_101,plain,
( necessarily(X1) = X1
| ~ is_a_theorem(implies(X1,necessarily(X1))) ),
inference(spm,[status(thm)],[c_0_77,c_0_93]) ).
fof(c_0_102,plain,
! [X53,X54,X55] :
( ( ~ or_3
| is_a_theorem(implies(implies(X53,X55),implies(implies(X54,X55),implies(or(X53,X54),X55)))) )
& ( ~ is_a_theorem(implies(implies(esk24_0,esk26_0),implies(implies(esk25_0,esk26_0),implies(or(esk24_0,esk25_0),esk26_0))))
| or_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_3])])])]) ).
cnf(c_0_103,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_104,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_105,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_106,plain,
implies(X1,strict_implies(X2,X2)) = strict_implies(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_99]) ).
cnf(c_0_107,plain,
is_a_theorem(strict_implies(X1,X1)),
inference(spm,[status(thm)],[c_0_100,c_0_99]) ).
fof(c_0_108,plain,
! [X37,X38] :
( ( ~ and_2
| is_a_theorem(implies(and(X37,X38),X38)) )
& ( ~ is_a_theorem(implies(and(esk16_0,esk17_0),esk17_0))
| and_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_2])])])]) ).
cnf(c_0_109,plain,
( necessarily(X1) = X1
| ~ is_a_theorem(necessarily(X1)) ),
inference(spm,[status(thm)],[c_0_101,c_0_78]) ).
cnf(c_0_110,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))
| ~ or_3 ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_111,plain,
or(X1,X2) = implies(not(X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_105])]) ).
cnf(c_0_112,plain,
or_3,
inference(split_conjunct,[status(thm)],[hilbert_or_3]) ).
cnf(c_0_113,plain,
( strict_implies(X1,X1) = X2
| ~ is_a_theorem(implies(strict_implies(X1,X1),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_106]),c_0_107])]) ).
cnf(c_0_114,plain,
( is_a_theorem(implies(and(X1,X2),X2))
| ~ and_2 ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_115,plain,
and_2,
inference(split_conjunct,[status(thm)],[hilbert_and_2]) ).
cnf(c_0_116,plain,
( necessarily(X1) = X1
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_72]) ).
cnf(c_0_117,plain,
necessarily(strict_implies(X1,X1)) = strict_implies(X2,strict_implies(X1,X1)),
inference(spm,[status(thm)],[c_0_73,c_0_106]) ).
cnf(c_0_118,plain,
( X1 = strict_implies(X2,X2)
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_106]),c_0_107])]) ).
cnf(c_0_119,plain,
implies(X1,implies(X2,X2)) = implies(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_90]),c_0_99]),c_0_99]) ).
cnf(c_0_120,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_81,c_0_68]) ).
cnf(c_0_121,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(implies(not(X1),X3),X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111]),c_0_112])]) ).
cnf(c_0_122,plain,
implies(X1,and(strict_implies(X2,X2),X1)) = strict_implies(X2,X2),
inference(spm,[status(thm)],[c_0_113,c_0_49]) ).
cnf(c_0_123,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_115])]) ).
cnf(c_0_124,plain,
strict_implies(X1,strict_implies(X2,X2)) = strict_implies(X2,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_107])]) ).
cnf(c_0_125,plain,
implies(X1,X1) = strict_implies(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_90]),c_0_99]) ).
cnf(c_0_126,plain,
( implies(X1,X1) = X2
| ~ is_a_theorem(implies(implies(X1,X1),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_119]),c_0_120])]) ).
cnf(c_0_127,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_81,c_0_121]) ).
cnf(c_0_128,plain,
and(strict_implies(X1,X1),X2) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_122]),c_0_107]),c_0_123])]) ).
cnf(c_0_129,plain,
strict_implies(X1,implies(X2,X2)) = implies(X2,X2),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
fof(c_0_130,plain,
! [X205] :
( ~ op_possibly
| possibly(X205) = not(necessarily(not(X205))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_possibly])])]) ).
cnf(c_0_131,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_104,c_0_104]) ).
cnf(c_0_132,plain,
implies(implies(not(X1),X1),X1) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_133,plain,
and(implies(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
( possibly(X1) = not(necessarily(not(X1)))
| ~ op_possibly ),
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_135,plain,
op_possibly,
inference(split_conjunct,[status(thm)],[km5_op_possibly]) ).
fof(c_0_136,plain,
! [X151] :
( ( ~ axiom_5
| is_a_theorem(implies(possibly(X151),necessarily(possibly(X151)))) )
& ( ~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0))))
| axiom_5 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
cnf(c_0_137,plain,
not(implies(X1,X2)) = implies(implies(X1,X2),and(X1,not(X2))),
inference(spm,[status(thm)],[c_0_131,c_0_99]) ).
cnf(c_0_138,plain,
implies(not(X1),X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_132]),c_0_133]),c_0_68])]) ).
cnf(c_0_139,plain,
not(necessarily(not(X1))) = possibly(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135])]) ).
cnf(c_0_140,plain,
( is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_5 ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_141,plain,
axiom_5,
inference(split_conjunct,[status(thm)],[km5_axiom_5]) ).
cnf(c_0_142,plain,
implies(X1,not(X1)) = not(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_99]) ).
cnf(c_0_143,plain,
not(strict_implies(X1,X2)) = possibly(and(X1,not(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_104]),c_0_73]) ).
cnf(c_0_144,plain,
strict_implies(not(X1),X1) = necessarily(X1),
inference(spm,[status(thm)],[c_0_73,c_0_138]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_141])]) ).
cnf(c_0_146,plain,
necessarily(not(X1)) = strict_implies(X1,not(X1)),
inference(spm,[status(thm)],[c_0_73,c_0_142]) ).
cnf(c_0_147,plain,
not(necessarily(X1)) = possibly(not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_99]) ).
cnf(c_0_148,plain,
necessarily(possibly(X1)) = possibly(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_145]),c_0_93])]) ).
cnf(c_0_149,plain,
not(and(X1,possibly(X2))) = implies(X1,necessarily(not(X2))),
inference(spm,[status(thm)],[c_0_104,c_0_139]) ).
fof(c_0_150,plain,
! [X201] :
( ( ~ axiom_m9
| is_a_theorem(strict_implies(possibly(possibly(X201)),possibly(X201))) )
& ( ~ is_a_theorem(strict_implies(possibly(possibly(esk93_0)),possibly(esk93_0)))
| axiom_m9 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m9])])])]) ).
fof(c_0_151,negated_conjecture,
~ axiom_m9,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_m6s3m9b_axiom_m9])]) ).
cnf(c_0_152,plain,
strict_implies(necessarily(X1),possibly(not(X1))) = possibly(not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]) ).
cnf(c_0_153,plain,
not(possibly(X1)) = implies(possibly(X1),necessarily(not(X1))),
inference(spm,[status(thm)],[c_0_149,c_0_99]) ).
cnf(c_0_154,plain,
not(not(X1)) = implies(not(X1),X1),
inference(spm,[status(thm)],[c_0_104,c_0_99]) ).
cnf(c_0_155,plain,
implies(possibly(not(X1)),necessarily(X1)) = necessarily(X1),
inference(spm,[status(thm)],[c_0_138,c_0_147]) ).
cnf(c_0_156,plain,
( axiom_m9
| ~ is_a_theorem(strict_implies(possibly(possibly(esk93_0)),possibly(esk93_0))) ),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_157,negated_conjecture,
~ axiom_m9,
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_158,plain,
possibly(necessarily(X1)) = necessarily(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_152]),c_0_153]),c_0_154]),c_0_138]),c_0_155]),c_0_153]),c_0_154]),c_0_138]),c_0_155]),c_0_99]) ).
cnf(c_0_159,plain,
~ is_a_theorem(strict_implies(possibly(possibly(esk93_0)),possibly(esk93_0))),
inference(sr,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_160,plain,
possibly(possibly(X1)) = possibly(X1),
inference(spm,[status(thm)],[c_0_158,c_0_148]) ).
cnf(c_0_161,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_107])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL535+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 13:14:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.juE1zidwhP/E---3.1_29859.p
% 0.17/0.53 # Version: 3.1pre001
% 0.17/0.53 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 29936 completed with status 0
% 0.17/0.53 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.17/0.53 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.53 # No SInE strategy applied
% 0.17/0.53 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.17/0.53 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.17/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/0.53 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.17/0.53 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 29948 completed with status 0
% 0.17/0.53 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.53 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.53 # No SInE strategy applied
% 0.17/0.53 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.17/0.53 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.17/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/0.53 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.53 # Preprocessing time : 0.002 s
% 0.17/0.53 # Presaturation interreduction done
% 0.17/0.53
% 0.17/0.53 # Proof found!
% 0.17/0.53 # SZS status Theorem
% 0.17/0.53 # SZS output start CNFRefutation
% See solution above
% 0.17/0.53 # Parsed axioms : 88
% 0.17/0.53 # Removed by relevancy pruning/SinE : 0
% 0.17/0.53 # Initial clauses : 146
% 0.17/0.53 # Removed in clause preprocessing : 0
% 0.17/0.53 # Initial clauses in saturation : 146
% 0.17/0.53 # Processed clauses : 683
% 0.17/0.53 # ...of these trivial : 74
% 0.17/0.53 # ...subsumed : 183
% 0.17/0.53 # ...remaining for further processing : 426
% 0.17/0.53 # Other redundant clauses eliminated : 0
% 0.17/0.53 # Clauses deleted for lack of memory : 0
% 0.17/0.53 # Backward-subsumed : 2
% 0.17/0.53 # Backward-rewritten : 79
% 0.17/0.53 # Generated clauses : 4393
% 0.17/0.53 # ...of the previous two non-redundant : 3023
% 0.17/0.53 # ...aggressively subsumed : 0
% 0.17/0.53 # Contextual simplify-reflections : 6
% 0.17/0.53 # Paramodulations : 4393
% 0.17/0.53 # Factorizations : 0
% 0.17/0.53 # NegExts : 0
% 0.17/0.53 # Equation resolutions : 0
% 0.17/0.53 # Total rewrite steps : 4782
% 0.17/0.53 # Propositional unsat checks : 0
% 0.17/0.53 # Propositional check models : 0
% 0.17/0.53 # Propositional check unsatisfiable : 0
% 0.17/0.53 # Propositional clauses : 0
% 0.17/0.53 # Propositional clauses after purity: 0
% 0.17/0.53 # Propositional unsat core size : 0
% 0.17/0.53 # Propositional preprocessing time : 0.000
% 0.17/0.53 # Propositional encoding time : 0.000
% 0.17/0.53 # Propositional solver time : 0.000
% 0.17/0.53 # Success case prop preproc time : 0.000
% 0.17/0.53 # Success case prop encoding time : 0.000
% 0.17/0.53 # Success case prop solver time : 0.000
% 0.17/0.53 # Current number of processed clauses : 232
% 0.17/0.53 # Positive orientable unit clauses : 138
% 0.17/0.53 # Positive unorientable unit clauses: 5
% 0.17/0.53 # Negative unit clauses : 5
% 0.17/0.53 # Non-unit-clauses : 84
% 0.17/0.53 # Current number of unprocessed clauses: 2554
% 0.17/0.53 # ...number of literals in the above : 3217
% 0.17/0.53 # Current number of archived formulas : 0
% 0.17/0.53 # Current number of archived clauses : 194
% 0.17/0.53 # Clause-clause subsumption calls (NU) : 3146
% 0.17/0.53 # Rec. Clause-clause subsumption calls : 1768
% 0.17/0.53 # Non-unit clause-clause subsumptions : 73
% 0.17/0.53 # Unit Clause-clause subsumption calls : 1115
% 0.17/0.53 # Rewrite failures with RHS unbound : 0
% 0.17/0.53 # BW rewrite match attempts : 1037
% 0.17/0.53 # BW rewrite match successes : 62
% 0.17/0.53 # Condensation attempts : 0
% 0.17/0.53 # Condensation successes : 0
% 0.17/0.53 # Termbank termtop insertions : 56521
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.066 s
% 0.17/0.53 # System time : 0.005 s
% 0.17/0.53 # Total time : 0.071 s
% 0.17/0.53 # Maximum resident set size: 2252 pages
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.302 s
% 0.17/0.53 # System time : 0.024 s
% 0.17/0.53 # Total time : 0.326 s
% 0.17/0.53 # Maximum resident set size: 1764 pages
% 0.17/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------