TSTP Solution File: LCL539+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL539+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:13 EDT 2023
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 77 ( 37 unt; 0 def)
% Number of atoms : 153 ( 24 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 125 ( 49 ~; 51 |; 12 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-2 aty)
% Number of variables : 88 ( 6 sgn; 38 !; 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/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',and_3) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',axiom_M) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',op_strict_implies) ).
fof(and_2,axiom,
( and_2
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',and_2) ).
fof(substitution_strict_equiv,axiom,
( substitution_strict_equiv
<=> ! [X1,X2] :
( is_a_theorem(strict_equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',substitution_strict_equiv) ).
fof(s1_0_substitution_strict_equiv,conjecture,
substitution_strict_equiv,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',s1_0_substitution_strict_equiv) ).
fof(op_strict_equiv,axiom,
( op_strict_equiv
=> ! [X1,X2] : strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',op_strict_equiv) ).
fof(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',and_1) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.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/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',op_equiv) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',hilbert_and_3) ).
fof(km4b_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',km4b_axiom_M) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',s1_0_op_strict_implies) ).
fof(hilbert_and_2,axiom,
and_2,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',hilbert_and_2) ).
fof(s1_0_op_strict_equiv,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',s1_0_op_strict_equiv) ).
fof(hilbert_and_1,axiom,
and_1,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',hilbert_and_1) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',substitution_of_equivalents) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p',hilbert_op_equiv) ).
fof(c_0_20,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_21,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_22,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])])])]) ).
fof(c_0_23,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])])]) ).
fof(c_0_24,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])])])]) ).
fof(c_0_25,plain,
! [X137,X138] :
( ( ~ substitution_strict_equiv
| ~ is_a_theorem(strict_equiv(X137,X138))
| X137 = X138 )
& ( is_a_theorem(strict_equiv(esk61_0,esk62_0))
| substitution_strict_equiv )
& ( esk61_0 != esk62_0
| substitution_strict_equiv ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_strict_equiv])])])])]) ).
fof(c_0_26,negated_conjecture,
~ substitution_strict_equiv,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[s1_0_substitution_strict_equiv])]) ).
fof(c_0_27,plain,
! [X209,X210] :
( ~ op_strict_equiv
| strict_equiv(X209,X210) = and(strict_implies(X209,X210),strict_implies(X210,X209)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_equiv])])]) ).
fof(c_0_28,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])])])]) ).
fof(c_0_29,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_30,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_31,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km4b_axiom_M]) ).
cnf(c_0_37,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(and(X1,X2),X2))
| ~ and_2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,plain,
and_2,
inference(split_conjunct,[status(thm)],[hilbert_and_2]) ).
cnf(c_0_41,plain,
( is_a_theorem(strict_equiv(esk61_0,esk62_0))
| substitution_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_42,negated_conjecture,
~ substitution_strict_equiv,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_43,plain,
( strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1))
| ~ op_strict_equiv ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
op_strict_equiv,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_46,plain,
and_1,
inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_48,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_49,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_50,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_51,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_31,c_0_32])]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_54,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_56,plain,
is_a_theorem(strict_equiv(esk61_0,esk62_0)),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_57,plain,
strict_equiv(X1,X2) = and(strict_implies(X1,X2),strict_implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_59,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_60,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(strict_implies(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(X2,X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_64,plain,
is_a_theorem(and(strict_implies(esk61_0,esk62_0),strict_implies(esk62_0,esk61_0))),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_66,plain,
( X1 = X2
| ~ is_a_theorem(and(implies(X1,X2),implies(X2,X1))) ),
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
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_51,c_0_61]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_62]) ).
cnf(c_0_69,plain,
is_a_theorem(strict_implies(esk62_0,esk61_0)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
is_a_theorem(strict_implies(esk61_0,esk62_0)),
inference(spm,[status(thm)],[c_0_65,c_0_64]) ).
cnf(c_0_71,plain,
( substitution_strict_equiv
| esk61_0 != esk62_0 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_72,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_73,plain,
is_a_theorem(implies(esk62_0,esk61_0)),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(esk61_0,esk62_0)),
inference(spm,[status(thm)],[c_0_68,c_0_70]) ).
cnf(c_0_75,plain,
esk62_0 != esk61_0,
inference(sr,[status(thm)],[c_0_71,c_0_42]) ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL539+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 12:31:50 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.v1kcjdYSdz/E---3.1_3039.p
% 0.18/0.50 # Version: 3.1pre001
% 0.18/0.50 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 3116 completed with status 0
% 0.18/0.50 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.18/0.50 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.18/0.50 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.18/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.18/0.50 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.18/0.50 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3132 completed with status 0
% 0.18/0.50 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 675s (1) cores
% 0.18/0.50 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.18/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.18/0.50 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.50 # Preprocessing time : 0.002 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 89
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 147
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 147
% 0.18/0.50 # Processed clauses : 358
% 0.18/0.50 # ...of these trivial : 40
% 0.18/0.50 # ...subsumed : 12
% 0.18/0.50 # ...remaining for further processing : 306
% 0.18/0.50 # Other redundant clauses eliminated : 0
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 1
% 0.18/0.50 # Backward-rewritten : 26
% 0.18/0.50 # Generated clauses : 244
% 0.18/0.50 # ...of the previous two non-redundant : 208
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 4
% 0.18/0.50 # Paramodulations : 244
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 0
% 0.18/0.50 # Total rewrite steps : 177
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 166
% 0.18/0.50 # Positive orientable unit clauses : 80
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 2
% 0.18/0.50 # Non-unit-clauses : 84
% 0.18/0.50 # Current number of unprocessed clauses: 110
% 0.18/0.50 # ...number of literals in the above : 152
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 140
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 2213
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 1109
% 0.18/0.50 # Non-unit clause-clause subsumptions : 16
% 0.18/0.50 # Unit Clause-clause subsumption calls : 395
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 150
% 0.18/0.50 # BW rewrite match successes : 14
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 11076
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.018 s
% 0.18/0.50 # System time : 0.006 s
% 0.18/0.50 # Total time : 0.024 s
% 0.18/0.50 # Maximum resident set size: 2256 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.074 s
% 0.18/0.50 # System time : 0.020 s
% 0.18/0.50 # Total time : 0.094 s
% 0.18/0.50 # Maximum resident set size: 1768 pages
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------