TSTP Solution File: LAT385+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:15:30 EDT 2024
% Result : Theorem 0.39s 0.56s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 277 ( 8 equ)
% Maximal formula atoms : 48 ( 13 avg)
% Number of connectives : 343 ( 87 ~; 102 |; 116 &)
% ( 1 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 64 ( 1 sgn 51 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
file('/export/starexec/sandbox2/tmp/tmp.3ntg11UWIT/E---3.1_16084.p',m__) ).
fof(m__1123,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
file('/export/starexec/sandbox2/tmp/tmp.3ntg11UWIT/E---3.1_16084.p',m__1123) ).
fof(m__1244,hypothesis,
( aSet0(xP)
& ! [X1] :
( ( aElementOf0(X1,xP)
=> ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aUpperBoundOfIn0(X1,xT,xU) ) )
& ( ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
| aUpperBoundOfIn0(X1,xT,xU) ) )
=> aElementOf0(X1,xP) ) )
& xP = cS1241(xU,xf,xT) ),
file('/export/starexec/sandbox2/tmp/tmp.3ntg11UWIT/E---3.1_16084.p',m__1244) ).
fof(c_0_3,plain,
! [X1] :
( epred1_1(X1)
<=> ? [X2] :
( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X1] :
( epred1_1(X1)
=> ? [X2] :
( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> epred1_1(X1) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[m__1123]),c_0_3]) ).
fof(c_0_7,negated_conjecture,
! [X90,X93,X94] :
( ( aElementOf0(esk15_1(X90),xU)
| aElementOf0(esk14_1(X90),xP)
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ aElementOf0(X93,xP)
| sdtlseqdt0(esk15_1(X90),X93)
| aElementOf0(esk14_1(X90),xP)
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( aLowerBoundOfIn0(esk15_1(X90),xP,xU)
| aElementOf0(esk14_1(X90),xP)
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ sdtlseqdt0(esk15_1(X90),X90)
| aElementOf0(esk14_1(X90),xP)
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( aElementOf0(esk15_1(X90),xU)
| ~ sdtlseqdt0(X90,esk14_1(X90))
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ aElementOf0(X93,xP)
| sdtlseqdt0(esk15_1(X90),X93)
| ~ sdtlseqdt0(X90,esk14_1(X90))
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( aLowerBoundOfIn0(esk15_1(X90),xP,xU)
| ~ sdtlseqdt0(X90,esk14_1(X90))
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ sdtlseqdt0(esk15_1(X90),X90)
| ~ sdtlseqdt0(X90,esk14_1(X90))
| ~ aElementOf0(X90,xU)
| ~ aElementOf0(X90,xU) )
& ( aElementOf0(esk15_1(X90),xU)
| ~ aLowerBoundOfIn0(X90,xP,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ aElementOf0(X93,xP)
| sdtlseqdt0(esk15_1(X90),X93)
| ~ aLowerBoundOfIn0(X90,xP,xU)
| ~ aElementOf0(X90,xU) )
& ( aLowerBoundOfIn0(esk15_1(X90),xP,xU)
| ~ aLowerBoundOfIn0(X90,xP,xU)
| ~ aElementOf0(X90,xU) )
& ( ~ sdtlseqdt0(esk15_1(X90),X90)
| ~ aLowerBoundOfIn0(X90,xP,xU)
| ~ aElementOf0(X90,xU) )
& ~ aInfimumOfIn0(X94,xP,xU) ),
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_4])])])])])])]) ).
fof(c_0_8,plain,
! [X95,X97,X98,X101,X102] :
( ( aElementOf0(esk16_1(X95),xU)
| ~ epred1_1(X95) )
& ( ~ aElementOf0(X97,X95)
| sdtlseqdt0(esk16_1(X95),X97)
| ~ epred1_1(X95) )
& ( aLowerBoundOfIn0(esk16_1(X95),X95,xU)
| ~ epred1_1(X95) )
& ( aElementOf0(esk17_2(X95,X98),X95)
| ~ aElementOf0(X98,xU)
| sdtlseqdt0(X98,esk16_1(X95))
| ~ epred1_1(X95) )
& ( ~ sdtlseqdt0(X98,esk17_2(X95,X98))
| ~ aElementOf0(X98,xU)
| sdtlseqdt0(X98,esk16_1(X95))
| ~ epred1_1(X95) )
& ( ~ aLowerBoundOfIn0(X98,X95,xU)
| sdtlseqdt0(X98,esk16_1(X95))
| ~ epred1_1(X95) )
& ( aInfimumOfIn0(esk16_1(X95),X95,xU)
| ~ epred1_1(X95) )
& ( aElementOf0(esk18_1(X95),xU)
| ~ epred1_1(X95) )
& ( ~ aElementOf0(X101,X95)
| sdtlseqdt0(X101,esk18_1(X95))
| ~ epred1_1(X95) )
& ( aUpperBoundOfIn0(esk18_1(X95),X95,xU)
| ~ epred1_1(X95) )
& ( aElementOf0(esk19_2(X95,X102),X95)
| ~ aElementOf0(X102,xU)
| sdtlseqdt0(esk18_1(X95),X102)
| ~ epred1_1(X95) )
& ( ~ sdtlseqdt0(esk19_2(X95,X102),X102)
| ~ aElementOf0(X102,xU)
| sdtlseqdt0(esk18_1(X95),X102)
| ~ epred1_1(X95) )
& ( ~ aUpperBoundOfIn0(X102,X95,xU)
| sdtlseqdt0(esk18_1(X95),X102)
| ~ epred1_1(X95) )
& ( aSupremumOfIn0(esk18_1(X95),X95,xU)
| ~ epred1_1(X95) ) ),
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_9,hypothesis,
! [X80,X82,X83] :
( aSet0(xU)
& ( aElementOf0(esk12_1(X80),X80)
| ~ aSet0(X80)
| epred1_1(X80) )
& ( ~ aElementOf0(esk12_1(X80),xU)
| ~ aSet0(X80)
| epred1_1(X80) )
& ( ~ aSubsetOf0(X80,xU)
| epred1_1(X80) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ( ~ aElementOf0(X82,szDzozmdt0(xf))
| ~ aElementOf0(X83,szDzozmdt0(xf))
| ~ sdtlseqdt0(X82,X83)
| sdtlseqdt0(sdtlpdtrp0(xf,X82),sdtlpdtrp0(xf,X83)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
fof(c_0_10,hypothesis,
! [X86,X87,X88] :
( aSet0(xP)
& ( aElementOf0(X86,xU)
| ~ aElementOf0(X86,xP) )
& ( sdtlseqdt0(sdtlpdtrp0(xf,X86),X86)
| ~ aElementOf0(X86,xP) )
& ( ~ aElementOf0(X87,xT)
| sdtlseqdt0(X87,X86)
| ~ aElementOf0(X86,xP) )
& ( aUpperBoundOfIn0(X86,xT,xU)
| ~ aElementOf0(X86,xP) )
& ( aElementOf0(esk13_1(X88),xT)
| ~ aElementOf0(X88,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X88),X88)
| aElementOf0(X88,xP) )
& ( ~ sdtlseqdt0(esk13_1(X88),X88)
| ~ aElementOf0(X88,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X88),X88)
| aElementOf0(X88,xP) )
& ( ~ aUpperBoundOfIn0(X88,xT,xU)
| ~ aElementOf0(X88,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X88),X88)
| aElementOf0(X88,xP) )
& xP = cS1241(xU,xf,xT) ),
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)],[m__1244])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( aInfimumOfIn0(esk16_1(X1),X1,xU)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(esk12_1(X1),X1)
| epred1_1(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ epred1_1(xP),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X1,xU)
| ~ aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aElementOf0(esk12_1(xP),xP),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,hypothesis,
( epred1_1(X1)
| ~ aElementOf0(esk12_1(X1),xU)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,hypothesis,
aElementOf0(esk12_1(xP),xU),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 08:40:21 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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/tmp/tmp.3ntg11UWIT/E---3.1_16084.p
% 0.39/0.56 # Version: 3.1.0
% 0.39/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.56 # Starting sh5l with 300s (1) cores
% 0.39/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16207 completed with status 0
% 0.39/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.39/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.56 # No SInE strategy applied
% 0.39/0.56 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.39/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.39/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.39/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.39/0.56 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.56 # U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 16215 completed with status 0
% 0.39/0.56 # Result found by U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.56 # No SInE strategy applied
% 0.39/0.56 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.39/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.39/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.39/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.39/0.56 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.56 # Preprocessing time : 0.006 s
% 0.39/0.56 # Presaturation interreduction done
% 0.39/0.56
% 0.39/0.56 # Proof found!
% 0.39/0.56 # SZS status Theorem
% 0.39/0.56 # SZS output start CNFRefutation
% See solution above
% 0.39/0.56 # Parsed axioms : 28
% 0.39/0.56 # Removed by relevancy pruning/SinE : 0
% 0.39/0.56 # Initial clauses : 110
% 0.39/0.56 # Removed in clause preprocessing : 4
% 0.39/0.56 # Initial clauses in saturation : 106
% 0.39/0.56 # Processed clauses : 169
% 0.39/0.56 # ...of these trivial : 0
% 0.39/0.56 # ...subsumed : 2
% 0.39/0.56 # ...remaining for further processing : 167
% 0.39/0.56 # Other redundant clauses eliminated : 1
% 0.39/0.56 # Clauses deleted for lack of memory : 0
% 0.39/0.56 # Backward-subsumed : 0
% 0.39/0.56 # Backward-rewritten : 0
% 0.39/0.56 # Generated clauses : 51
% 0.39/0.56 # ...of the previous two non-redundant : 43
% 0.39/0.56 # ...aggressively subsumed : 0
% 0.39/0.56 # Contextual simplify-reflections : 5
% 0.39/0.56 # Paramodulations : 50
% 0.39/0.56 # Factorizations : 0
% 0.39/0.56 # NegExts : 0
% 0.39/0.56 # Equation resolutions : 1
% 0.39/0.56 # Disequality decompositions : 0
% 0.39/0.56 # Total rewrite steps : 35
% 0.39/0.56 # ...of those cached : 28
% 0.39/0.56 # Propositional unsat checks : 0
% 0.39/0.56 # Propositional check models : 0
% 0.39/0.56 # Propositional check unsatisfiable : 0
% 0.39/0.56 # Propositional clauses : 0
% 0.39/0.56 # Propositional clauses after purity: 0
% 0.39/0.56 # Propositional unsat core size : 0
% 0.39/0.56 # Propositional preprocessing time : 0.000
% 0.39/0.56 # Propositional encoding time : 0.000
% 0.39/0.56 # Propositional solver time : 0.000
% 0.39/0.56 # Success case prop preproc time : 0.000
% 0.39/0.56 # Success case prop encoding time : 0.000
% 0.39/0.56 # Success case prop solver time : 0.000
% 0.39/0.56 # Current number of processed clauses : 60
% 0.39/0.56 # Positive orientable unit clauses : 15
% 0.39/0.56 # Positive unorientable unit clauses: 0
% 0.39/0.56 # Negative unit clauses : 4
% 0.39/0.56 # Non-unit-clauses : 41
% 0.39/0.56 # Current number of unprocessed clauses: 82
% 0.39/0.56 # ...number of literals in the above : 297
% 0.39/0.56 # Current number of archived formulas : 0
% 0.39/0.56 # Current number of archived clauses : 106
% 0.39/0.56 # Clause-clause subsumption calls (NU) : 2555
% 0.39/0.56 # Rec. Clause-clause subsumption calls : 1302
% 0.39/0.56 # Non-unit clause-clause subsumptions : 7
% 0.39/0.56 # Unit Clause-clause subsumption calls : 40
% 0.39/0.56 # Rewrite failures with RHS unbound : 0
% 0.39/0.56 # BW rewrite match attempts : 0
% 0.39/0.56 # BW rewrite match successes : 0
% 0.39/0.56 # Condensation attempts : 0
% 0.39/0.56 # Condensation successes : 0
% 0.39/0.56 # Termbank termtop insertions : 9189
% 0.39/0.56 # Search garbage collected termcells : 2045
% 0.39/0.56
% 0.39/0.56 # -------------------------------------------------
% 0.39/0.56 # User time : 0.012 s
% 0.39/0.56 # System time : 0.007 s
% 0.39/0.56 # Total time : 0.019 s
% 0.39/0.56 # Maximum resident set size: 2048 pages
% 0.39/0.56
% 0.39/0.56 # -------------------------------------------------
% 0.39/0.56 # User time : 0.047 s
% 0.39/0.56 # System time : 0.028 s
% 0.39/0.56 # Total time : 0.075 s
% 0.39/0.56 # Maximum resident set size: 1744 pages
% 0.39/0.56 % E---3.1 exiting
% 0.39/0.56 % E exiting
%------------------------------------------------------------------------------