%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM536+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:28 PM UTC 2026
% Result : Theorem 0.27s 0.56s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 271 ( 63 equ)
% Maximal formula atoms : 54 ( 7 avg)
% Number of connectives : 377 ( 142 ~; 159 |; 53 &)
% ( 12 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 67 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xS,xx))
<=> ( ( X1 = xx
| aElementOf0(X1,xS) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))
<=> ( X1 != xx
& aElementOf0(X1,sdtpldt0(xS,xx))
& aElement0(X1) ) )
& aSet0(sdtmndt0(sdtpldt0(xS,xx),xx)) )
=> sdtmndt0(sdtpldt0(xS,xx),xx) = xS ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__679,hypothesis,
( aSet0(xS)
& aElement0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__679) ).
fof(mDefCons,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtpldt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( ( X4 = X2
| aElementOf0(X4,X1) )
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefCons) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__679_02,hypothesis,
~ aElementOf0(xx,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__679_02) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ aElement0(X12)
| ~ aSet0(X11)
| X16 = sdtmndt0(X11,X12)
| ~ aSet0(X16)
| aElementOf0(esk1_3(X11,X12,X16),X16)
| esk1_3(X11,X12,X16) != X12 )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X16 = sdtmndt0(X11,X12)
| ~ aSet0(X16)
| aElementOf0(esk1_3(X11,X12,X16),X16)
| aElementOf0(esk1_3(X11,X12,X16),X11) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X16 = sdtmndt0(X11,X12)
| ~ aSet0(X16)
| aElementOf0(esk1_3(X11,X12,X16),X16)
| aElement0(esk1_3(X11,X12,X16)) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X16 = sdtmndt0(X11,X12)
| ~ aSet0(X16)
| esk1_3(X11,X12,X16) = X12
| ~ aElementOf0(esk1_3(X11,X12,X16),X11)
| ~ aElement0(esk1_3(X11,X12,X16))
| ~ aElementOf0(esk1_3(X11,X12,X16),X16) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X13 != sdtmndt0(X11,X12)
| aElementOf0(X15,X13)
| X15 = X12
| ~ aElementOf0(X15,X11)
| ~ aElement0(X15) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X13 != sdtmndt0(X11,X12)
| ~ aElementOf0(X14,X13)
| X14 != X12 )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X13 != sdtmndt0(X11,X12)
| ~ aElementOf0(X14,X13)
| aElementOf0(X14,X11) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X13 != sdtmndt0(X11,X12)
| ~ aElementOf0(X14,X13)
| aElement0(X14) )
& ( ~ aElement0(X12)
| ~ aSet0(X11)
| X13 != sdtmndt0(X11,X12)
| aSet0(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xS,xx))
<=> ( ( X1 = xx
| aElementOf0(X1,xS) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))
<=> ( X1 != xx
& aElementOf0(X1,sdtpldt0(xS,xx))
& aElement0(X1) ) )
& aSet0(sdtmndt0(sdtpldt0(xS,xx),xx)) )
=> sdtmndt0(sdtpldt0(xS,xx),xx) = xS ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( ~ aElement0(X2)
| ~ aSet0(X1)
| ~ aSet0(X3)
| X3 = sdtmndt0(X1,X2)
| aElementOf0(esk1_3(X1,X2,X3),X3)
| aElementOf0(esk1_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__679]) ).
fof(c_0_11,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xS,xx))
<=> ( ( X1 = xx
| aElementOf0(X1,xS) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))
<=> ( X1 != xx
& aElementOf0(X1,sdtpldt0(xS,xx))
& aElement0(X1) ) )
& aSet0(sdtmndt0(sdtpldt0(xS,xx),xx)) )
=> sdtmndt0(sdtpldt0(xS,xx),xx) = xS ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ aElement0(X21)
| ~ aSet0(X20)
| X25 = sdtpldt0(X20,X21)
| ~ aSet0(X25)
| aElementOf0(esk2_3(X20,X21,X25),X25)
| esk2_3(X20,X21,X25) = X21
| aElementOf0(esk2_3(X20,X21,X25),X20) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X25 = sdtpldt0(X20,X21)
| ~ aSet0(X25)
| aElementOf0(esk2_3(X20,X21,X25),X25)
| aElement0(esk2_3(X20,X21,X25)) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X25 = sdtpldt0(X20,X21)
| ~ aSet0(X25)
| ~ aElementOf0(esk2_3(X20,X21,X25),X25)
| ~ aElement0(esk2_3(X20,X21,X25))
| esk2_3(X20,X21,X25) != X21 )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X25 = sdtpldt0(X20,X21)
| ~ aSet0(X25)
| ~ aElementOf0(esk2_3(X20,X21,X25),X25)
| ~ aElement0(esk2_3(X20,X21,X25))
| ~ aElementOf0(esk2_3(X20,X21,X25),X20) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X22 != sdtpldt0(X20,X21)
| aElementOf0(X24,X22)
| ~ aElement0(X24)
| X24 != X21 )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X22 != sdtpldt0(X20,X21)
| aElementOf0(X24,X22)
| ~ aElement0(X24)
| ~ aElementOf0(X24,X20) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X22 != sdtpldt0(X20,X21)
| ~ aElementOf0(X23,X22)
| X23 = X21
| aElementOf0(X23,X20) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X22 != sdtpldt0(X20,X21)
| ~ aElementOf0(X23,X22)
| aElement0(X23) )
& ( ~ aElement0(X21)
| ~ aSet0(X20)
| X22 != sdtpldt0(X20,X21)
| aSet0(X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefCons])])])])])])]) ).
cnf(c_0_13,hypothesis,
( ~ aSet0(X2)
| ~ aSet0(X1)
| aElementOf0(esk1_3(X2,xx,X1),X2)
| aElementOf0(esk1_3(X2,xx,X1),X1)
| X1 = sdtmndt0(X2,xx) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__679]) ).
fof(c_0_15,negated_conjecture,
! [X5,X6] :
( sdtmndt0(sdtpldt0(xS,xx),xx) != xS
& ( aElementOf0(X6,sdtmndt0(sdtpldt0(xS,xx),xx))
| X6 = xx
| ~ aElementOf0(X6,sdtpldt0(xS,xx))
| ~ aElement0(X6) )
& ( ~ aElementOf0(X6,sdtmndt0(sdtpldt0(xS,xx),xx))
| X6 != xx )
& ( ~ aElementOf0(X6,sdtmndt0(sdtpldt0(xS,xx),xx))
| aElementOf0(X6,sdtpldt0(xS,xx)) )
& ( ~ aElementOf0(X6,sdtmndt0(sdtpldt0(xS,xx),xx))
| aElement0(X6) )
& aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))
& ( aElementOf0(X5,sdtpldt0(xS,xx))
| ~ aElement0(X5)
| X5 != xx )
& ( aElementOf0(X5,sdtpldt0(xS,xx))
| ~ aElement0(X5)
| ~ aElementOf0(X5,xS) )
& ( ~ aElementOf0(X5,sdtpldt0(xS,xx))
| X5 = xx
| aElementOf0(X5,xS) )
& ( ~ aElementOf0(X5,sdtpldt0(xS,xx))
| aElement0(X5) )
& aSet0(sdtpldt0(xS,xx)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_16,plain,
! [X9,X10] :
( aElement0(X10)
| ~ aElementOf0(X10,X9)
| ~ aSet0(X9) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_17,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X4 != sdtpldt0(X2,X3)
| ~ aElementOf0(X1,X4)
| X1 = X3
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
( ~ aSet0(X1)
| aElementOf0(esk1_3(X1,xx,xS),X1)
| aElementOf0(esk1_3(X1,xx,xS),xS)
| sdtmndt0(X1,xx) = xS ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
aSet0(sdtpldt0(xS,xx)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
sdtmndt0(sdtpldt0(xS,xx),xx) != xS,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| ~ aSet0(X1)
| ~ aSet0(X3)
| ~ aElementOf0(esk1_3(X1,X2,X3),X1)
| ~ aElement0(esk1_3(X1,X2,X3))
| ~ aElementOf0(esk1_3(X1,X2,X3),X3)
| X3 = sdtmndt0(X1,X2)
| esk1_3(X1,X2,X3) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aElementOf0(X1,sdtpldt0(X3,X2))
| aElementOf0(X1,X3)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( aElementOf0(esk1_3(sdtpldt0(xS,xx),xx,xS),xS)
| aElementOf0(esk1_3(sdtpldt0(xS,xx),xx,xS),sdtpldt0(xS,xx)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( ~ aSet0(X1)
| ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aElementOf0(esk1_3(X1,X2,X3),X1)
| ~ aElementOf0(esk1_3(X1,X2,X3),X3)
| X3 = sdtmndt0(X1,X2)
| esk1_3(X1,X2,X3) = X2 ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(esk1_3(sdtpldt0(xS,xx),xx,xS),xS)
| esk1_3(sdtpldt0(xS,xx),xx,xS) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_10]),c_0_14])]) ).
cnf(c_0_27,plain,
( ~ aElement0(X4)
| ~ aSet0(X2)
| X3 != sdtpldt0(X2,X4)
| ~ aElement0(X1)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_28,hypothesis,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[m__679_02]) ).
cnf(c_0_29,negated_conjecture,
( ~ aElementOf0(esk1_3(sdtpldt0(xS,xx),xx,xS),sdtpldt0(xS,xx))
| esk1_3(sdtpldt0(xS,xx),xx,xS) = xx ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_10]),c_0_14]),c_0_19])]),c_0_20]) ).
cnf(c_0_30,plain,
( ~ aSet0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,sdtpldt0(X2,X3)) ),
inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_27,c_0_22])]) ).
fof(c_0_31,hypothesis,
~ aElementOf0(xx,xS),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( ~ aElement0(X2)
| ~ aSet0(X1)
| ~ aSet0(X3)
| esk1_3(X1,X2,X3) != X2
| X3 = sdtmndt0(X1,X2)
| aElementOf0(esk1_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,negated_conjecture,
esk1_3(sdtpldt0(xS,xx),xx,xS) = xx,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_10]),c_0_14])]),c_0_26]) ).
cnf(c_0_34,hypothesis,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_10]),c_0_14]),c_0_19])]),c_0_20]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM536+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n001.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 02:43:58 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.27/0.56 % Version: 3.5.1
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % new_bool_3 with pid 2015642 completed with status 0
% 0.27/0.56 % Result found by new_bool_3
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.56 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.27/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.56 % SubtermCWHack with pid 2015646 completed with status 0
% 0.27/0.56 % Result found by SubtermCWHack
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.56 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.27/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.56 % Preprocessing time : 0.002 s
% 0.27/0.56
% 0.27/0.56 % Proof found!
% 0.27/0.56 % SZS status Theorem
% 0.27/0.56 % SZS output start CNFRefutation
% See solution above
% 0.27/0.56 % Parsed axioms : 20
% 0.27/0.56 % Removed by relevancy pruning/SinE : 11
% 0.27/0.56 % Initial clauses : 36
% 0.27/0.56 % Removed in clause preprocessing : 2
% 0.27/0.56 % Initial clauses in saturation : 34
% 0.27/0.56 % Processed clauses : 98
% 0.27/0.56 % ...of these trivial : 4
% 0.27/0.56 % ...subsumed : 23
% 0.27/0.56 % ...remaining for further processing : 71
% 0.27/0.56 % Other redundant clauses eliminated : 14
% 0.27/0.56 % Clauses deleted for lack of memory : 0
% 0.27/0.56 % Backward-subsumed : 2
% 0.27/0.56 % Backward-rewritten : 10
% 0.27/0.56 % Generated clauses : 158
% 0.27/0.56 % ...of the previous two non-redundant : 130
% 0.27/0.56 % ...aggressively subsumed : 0
% 0.27/0.56 % Contextual simplify-reflections : 13
% 0.27/0.56 % Paramodulations : 146
% 0.27/0.56 % Factorizations : 0
% 0.27/0.56 % NegExts : 0
% 0.27/0.56 % Equation resolutions : 14
% 0.27/0.56 % Disequality decompositions : 0
% 0.27/0.56 % Total rewrite steps : 122
% 0.27/0.56 % ...of those cached : 114
% 0.27/0.56 % Propositional unsat checks : 0
% 0.27/0.56 % Propositional check models : 0
% 0.27/0.56 % Propositional check unsatisfiable : 0
% 0.27/0.56 % Propositional clauses : 0
% 0.27/0.56 % Propositional clauses after purity: 0
% 0.27/0.56 % Propositional unsat core size : 0
% 0.27/0.56 % Propositional preprocessing time : 0.000
% 0.27/0.56 % Propositional encoding time : 0.000
% 0.27/0.56 % Propositional solver time : 0.000
% 0.27/0.56 % Success case prop preproc time : 0.000
% 0.27/0.56 % Success case prop encoding time : 0.000
% 0.27/0.56 % Success case prop solver time : 0.000
% 0.27/0.56 % Current number of processed clauses : 47
% 0.27/0.56 % Positive orientable unit clauses : 7
% 0.27/0.56 % Positive unorientable unit clauses: 0
% 0.27/0.56 % Negative unit clauses : 3
% 0.27/0.56 % Non-unit-clauses : 37
% 0.27/0.56 % Current number of unprocessed clauses: 65
% 0.27/0.56 % ...number of literals in the above : 403
% 0.27/0.56 % Current number of archived formulas : 0
% 0.27/0.56 % Current number of archived clauses : 12
% 0.27/0.56 % Clause-clause subsumption calls (NU) : 377
% 0.27/0.56 % Rec. Clause-clause subsumption calls : 130
% 0.27/0.56 % Non-unit clause-clause subsumptions : 34
% 0.27/0.56 % Unit Clause-clause subsumption calls : 18
% 0.27/0.56 % Rewrite failures with RHS unbound : 0
% 0.27/0.56 % BW rewrite match attempts : 3
% 0.27/0.56 % BW rewrite match successes : 2
% 0.27/0.56 % Condensation attempts : 0
% 0.27/0.56 % Condensation successes : 0
% 0.27/0.56 % Termbank termtop insertions : 6422
% 0.27/0.56 % Search garbage collected termcells : 802
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.020 s
% 0.27/0.56 % System time : 0.004 s
% 0.27/0.56 % Total time : 0.023 s
% 0.27/0.56 % Maximum resident set size: 3600 pages
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.021 s
% 0.27/0.56 % System time : 0.009 s
% 0.27/0.56 % Total time : 0.029 s
% 0.27/0.56 % Maximum resident set size: 4864 pages
% 0.27/0.56 % E exiting
%------------------------------------------------------------------------------