%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM455+6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:08 PM UTC 2026
% Result : ContradictoryAxioms 0.18s 10.54s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 206 ( 49 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 241 ( 65 ~; 55 |; 105 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 27 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2171,hypothesis,
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(X1,stldt0(sbsmnsldt0(xS))) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( ~ aElementOf0(X1,sbsmnsldt0(xS))
& aInteger0(X1) ) )
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( ? [X2] :
( aElementOf0(X1,X2)
& aElementOf0(X2,xS) )
& aInteger0(X1) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,sz10,xp)
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| ? [X2] :
( sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( sdteqdtlpzmzozddtrp0(X1,sz10,xp)
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& ? [X2] :
( sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& xp != sz00
& aInteger0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2171) ).
fof(m__2079,hypothesis,
( stldt0(sbsmnsldt0(xS)) = cS2076
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = smndt0(sz10)
| X1 = sz10 ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( ~ aElementOf0(X1,sbsmnsldt0(xS))
& aInteger0(X1) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( ? [X2] :
( aElementOf0(X1,X2)
& aElementOf0(X2,xS) )
& aInteger0(X1) ) )
& aSet0(sbsmnsldt0(xS)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2079) ).
fof(m__2232,hypothesis,
( aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))
& aInteger0(X1) )
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))
& aInteger0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2232) ).
fof(m__2258,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != sz10
& sdtpldt0(sz10,xp) != sz10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2258) ).
fof(m__2286,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2286) ).
fof(c_0_5,hypothesis,
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(X1,stldt0(sbsmnsldt0(xS))) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( ~ aElementOf0(X1,sbsmnsldt0(xS))
& aInteger0(X1) ) )
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( ? [X2] :
( aElementOf0(X1,X2)
& aElementOf0(X2,xS) )
& aInteger0(X1) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,sz10,xp)
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| ? [X2] :
( sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( sdteqdtlpzmzozddtrp0(X1,sz10,xp)
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& ? [X2] :
( sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& xp != sz00
& aInteger0(xp) ),
inference(fof_simplification,[status(thm)],[m__2171]) ).
fof(c_0_6,hypothesis,
( stldt0(sbsmnsldt0(xS)) = cS2076
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = smndt0(sz10)
| X1 = sz10 ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( ~ aElementOf0(X1,sbsmnsldt0(xS))
& aInteger0(X1) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( ? [X2] :
( aElementOf0(X1,X2)
& aElementOf0(X2,xS) )
& aInteger0(X1) ) )
& aSet0(sbsmnsldt0(xS)) ),
inference(fof_simplification,[status(thm)],[m__2079]) ).
fof(c_0_7,hypothesis,
! [X47,X49,X50,X51,X53,X54,X55,X56] :
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS)))
& ( aElementOf0(X56,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X56,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aElementOf0(X55,stldt0(sbsmnsldt0(xS)))
| aElementOf0(X55,sbsmnsldt0(xS))
| ~ aInteger0(X55) )
& ( ~ aElementOf0(X55,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X55,sbsmnsldt0(xS)) )
& ( ~ aElementOf0(X55,stldt0(sbsmnsldt0(xS)))
| aInteger0(X55) )
& ( aElementOf0(X53,sbsmnsldt0(xS))
| ~ aElementOf0(X53,X54)
| ~ aElementOf0(X54,xS)
| ~ aInteger0(X53) )
& ( ~ aElementOf0(X51,sbsmnsldt0(xS))
| aElementOf0(X51,esk12_1(X51)) )
& ( ~ aElementOf0(X51,sbsmnsldt0(xS))
| aElementOf0(esk12_1(X51),xS) )
& ( ~ aElementOf0(X51,sbsmnsldt0(xS))
| aInteger0(X51) )
& aSet0(sbsmnsldt0(xS))
& ( aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aInteger0(X49)
| ~ sdteqdtlpzmzozddtrp0(X49,sz10,xp) )
& ( aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aInteger0(X49)
| ~ aDivisorOf0(xp,sdtpldt0(X49,smndt0(sz10))) )
& ( aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aInteger0(X49)
| sdtasdt0(xp,X50) != sdtpldt0(X49,smndt0(sz10))
| ~ aInteger0(X50) )
& ( ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| sdteqdtlpzmzozddtrp0(X47,sz10,xp) )
& ( ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aDivisorOf0(xp,sdtpldt0(X47,smndt0(sz10))) )
& ( ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| sdtasdt0(xp,esk11_1(X47)) = sdtpldt0(X47,smndt0(sz10)) )
& ( ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aInteger0(esk11_1(X47)) )
& ( ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aInteger0(X47) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& xp != sz00
& aInteger0(xp) ),
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_5])])])])])])]) ).
fof(c_0_8,hypothesis,
! [X17,X19,X20,X21,X22] :
( stldt0(sbsmnsldt0(xS)) = cS2076
& ( aElementOf0(X22,stldt0(sbsmnsldt0(xS)))
| X22 != smndt0(sz10) )
& ( aElementOf0(X22,stldt0(sbsmnsldt0(xS)))
| X22 != sz10 )
& ( X22 = smndt0(sz10)
| X22 = sz10
| ~ aElementOf0(X22,stldt0(sbsmnsldt0(xS))) )
& ( aElementOf0(X21,stldt0(sbsmnsldt0(xS)))
| aElementOf0(X21,sbsmnsldt0(xS))
| ~ aInteger0(X21) )
& ( ~ aElementOf0(X21,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X21,sbsmnsldt0(xS)) )
& ( ~ aElementOf0(X21,stldt0(sbsmnsldt0(xS)))
| aInteger0(X21) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( aElementOf0(X19,sbsmnsldt0(xS))
| ~ aElementOf0(X19,X20)
| ~ aElementOf0(X20,xS)
| ~ aInteger0(X19) )
& ( ~ aElementOf0(X17,sbsmnsldt0(xS))
| aElementOf0(X17,esk4_1(X17)) )
& ( ~ aElementOf0(X17,sbsmnsldt0(xS))
| aElementOf0(esk4_1(X17),xS) )
& ( ~ aElementOf0(X17,sbsmnsldt0(xS))
| aInteger0(X17) )
& aSet0(sbsmnsldt0(xS)) ),
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])])])])])])]) ).
cnf(c_0_9,hypothesis,
( ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
stldt0(sbsmnsldt0(xS)) = cS2076,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,hypothesis,
( aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdtasdt0(xp,esk14_0) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))
& aInteger0(esk14_0)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdtasdt0(xp,esk13_0) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))
& aInteger0(esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2232])]) ).
fof(c_0_12,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != sz10
& sdtpldt0(sz10,xp) != sz10 ),
inference(fof_simplification,[status(thm)],[m__2258]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| X1 = smndt0(sz10)
| X1 = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,hypothesis,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != sz10
& sdtpldt0(sz10,xp) != sz10 ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_17,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
inference(fof_simplification,[status(thm)],[m__2286]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,cS2076)
| X1 = sz10
| X1 = smndt0(sz10) ),
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_19,hypothesis,
aElementOf0(sdtpldt0(sz10,xp),cS2076),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
sdtpldt0(sz10,xp) != sz10,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
smndt0(sz10) = sdtpldt0(sz10,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,hypothesis,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
( ~ aElementOf0(X1,cS2076)
| X1 = sz10
| X1 = sdtpldt0(sz10,xp) ),
inference(rw,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,hypothesis,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),cS2076),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_27,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sdtpldt0(sz10,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_22]),c_0_22])]) ).
cnf(c_0_28,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sz10,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM455+6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.41 % Computer : n014.cluster.edu
% 0.13/10.41 % Model : x86_64 x86_64
% 0.13/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.41 % Memory : 8046.5625MB
% 0.13/10.41 % OS : Linux 6.8.0-71-generic
% 0.13/10.41 % CPULimit : 300
% 0.13/10.41 % WCLimit : 300
% 0.13/10.41 % DateTime : Mon Sep 21 02:31:45 UTC 2026
% 0.13/10.41 % CPUTime :
% 0.13/10.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.45 Running first-order theorem proving
% 0.13/10.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/10.54 % Version: 3.5.1
% 0.18/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/10.54 % Starting new_bool_3 with 300s (1) cores
% 0.18/10.54 % Starting new_bool_1 with 300s (1) cores
% 0.18/10.54 % Starting sh5l with 300s (1) cores
% 0.18/10.54 % new_bool_3 with pid 2950786 completed with status 0
% 0.18/10.54 % Result found by new_bool_3
% 0.18/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/10.54 % Starting new_bool_3 with 300s (1) cores
% 0.18/10.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/10.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/10.54 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/10.54 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/10.54 % Starting SubtermCWHack with 28s (1) cores
% 0.18/10.54 % SubtermCWHack with pid 2950793 completed with status 0
% 0.18/10.54 % Result found by SubtermCWHack
% 0.18/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/10.54 % Starting new_bool_3 with 300s (1) cores
% 0.18/10.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/10.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/10.54 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/10.54 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/10.54 % Starting SubtermCWHack with 28s (1) cores
% 0.18/10.54 % Preprocessing time : 0.005 s
% 0.18/10.54
% 0.18/10.54 % Proof found!
% 0.18/10.54 % SZS status ContradictoryAxioms
% 0.18/10.54 % SZS output start CNFRefutation
% See solution above
% 0.18/10.54 % Parsed axioms : 50
% 0.18/10.54 % Removed by relevancy pruning/SinE : 4
% 0.18/10.54 % Initial clauses : 217
% 0.18/10.54 % Removed in clause preprocessing : 5
% 0.18/10.54 % Initial clauses in saturation : 212
% 0.18/10.54 % Processed clauses : 213
% 0.18/10.54 % ...of these trivial : 5
% 0.18/10.54 % ...subsumed : 47
% 0.18/10.54 % ...remaining for further processing : 161
% 0.18/10.54 % Other redundant clauses eliminated : 11
% 0.18/10.54 % Clauses deleted for lack of memory : 0
% 0.18/10.54 % Backward-subsumed : 0
% 0.18/10.54 % Backward-rewritten : 15
% 0.18/10.54 % Generated clauses : 207
% 0.18/10.54 % ...of the previous two non-redundant : 161
% 0.18/10.54 % ...aggressively subsumed : 0
% 0.18/10.54 % Contextual simplify-reflections : 0
% 0.18/10.54 % Paramodulations : 196
% 0.18/10.54 % Factorizations : 0
% 0.18/10.54 % NegExts : 0
% 0.18/10.54 % Equation resolutions : 11
% 0.18/10.54 % Disequality decompositions : 0
% 0.18/10.54 % Total rewrite steps : 222
% 0.18/10.54 % ...of those cached : 193
% 0.18/10.54 % Propositional unsat checks : 0
% 0.18/10.54 % Propositional check models : 0
% 0.18/10.54 % Propositional check unsatisfiable : 0
% 0.18/10.54 % Propositional clauses : 0
% 0.18/10.54 % Propositional clauses after purity: 0
% 0.18/10.54 % Propositional unsat core size : 0
% 0.18/10.54 % Propositional preprocessing time : 0.000
% 0.18/10.54 % Propositional encoding time : 0.000
% 0.18/10.54 % Propositional solver time : 0.000
% 0.18/10.54 % Success case prop preproc time : 0.000
% 0.18/10.54 % Success case prop encoding time : 0.000
% 0.18/10.54 % Success case prop solver time : 0.000
% 0.18/10.54 % Current number of processed clauses : 135
% 0.18/10.54 % Positive orientable unit clauses : 39
% 0.18/10.54 % Positive unorientable unit clauses: 0
% 0.18/10.54 % Negative unit clauses : 4
% 0.18/10.54 % Non-unit-clauses : 92
% 0.18/10.54 % Current number of unprocessed clauses: 154
% 0.18/10.54 % ...number of literals in the above : 671
% 0.18/10.54 % Current number of archived formulas : 0
% 0.18/10.54 % Current number of archived clauses : 15
% 0.18/10.54 % Clause-clause subsumption calls (NU) : 1009
% 0.18/10.54 % Rec. Clause-clause subsumption calls : 745
% 0.18/10.54 % Non-unit clause-clause subsumptions : 47
% 0.18/10.54 % Unit Clause-clause subsumption calls : 32
% 0.18/10.54 % Rewrite failures with RHS unbound : 0
% 0.18/10.54 % BW rewrite match attempts : 6
% 0.18/10.54 % BW rewrite match successes : 5
% 0.18/10.54 % Condensation attempts : 0
% 0.18/10.54 % Condensation successes : 0
% 0.18/10.54 % Termbank termtop insertions : 18453
% 0.18/10.54 % Search garbage collected termcells : 3355
% 0.18/10.54
% 0.18/10.54 % -------------------------------------------------
% 0.18/10.54 % User time : 0.031 s
% 0.18/10.54 % System time : 0.005 s
% 0.18/10.54 % Total time : 0.036 s
% 0.18/10.54 % Maximum resident set size: 4228 pages
% 0.18/10.54
% 0.18/10.54 % -------------------------------------------------
% 0.18/10.54 % User time : 0.035 s
% 0.18/10.54 % System time : 0.009 s
% 0.18/10.54 % Total time : 0.044 s
% 0.18/10.54 % Maximum resident set size: 4864 pages
% 0.18/10.54 % E exiting
%------------------------------------------------------------------------------