TSTP Solution File: NUM578+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM578+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:55:27 EDT 2024
% Result : Theorem 41.60s 5.78s
% Output : CNFRefutation 41.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 162 ( 22 equ)
% Maximal formula atoms : 39 ( 7 avg)
% Number of connectives : 192 ( 52 ~; 46 |; 60 &)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nbfq8ANw2i/E---3.1_23637.p',m__3856_02) ).
fof(m__,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
| szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ) ) )
=> ( xi != xj
=> ~ ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xj))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nbfq8ANw2i/E---3.1_23637.p',m__) ).
fof(m__3856,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp.Nbfq8ANw2i/E---3.1_23637.p',m__3856) ).
fof(c_0_3,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
| szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ) ),
introduced(definition) ).
fof(c_0_4,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
inference(fof_simplification,[status(thm)],[m__3856_02]) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> epred1_2(X1,X2) ) )
=> ( xi != xj
=> ~ ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xj))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]),c_0_3]) ).
fof(c_0_6,hypothesis,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
! [X217,X218,X219,X220] :
( ( ~ aElementOf0(X217,szNzAzT0)
| ~ aElementOf0(X218,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X217),X218)
| epred1_2(X217,X218) )
& xi != xj
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X219,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X219) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ( ~ aElementOf0(X220,sdtlpdtrp0(xN,xj))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X220) )
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,hypothesis,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) ) )
| szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( epred1_2(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
fof(c_0_15,plain,
! [X221,X222,X223,X224,X225,X226,X227] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X222)),sdtlpdtrp0(xN,X222))
| ~ epred1_2(X222,X221) )
& ( ~ aElementOf0(X223,sdtlpdtrp0(xN,X222))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X222)),X223)
| ~ epred1_2(X222,X221) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( aElement0(X224)
| ~ aElementOf0(X224,sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( aElementOf0(X224,sdtlpdtrp0(xN,X222))
| ~ aElementOf0(X224,sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( X224 != szmzizndt0(sdtlpdtrp0(xN,X222))
| ~ aElementOf0(X224,sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( ~ aElement0(X225)
| ~ aElementOf0(X225,sdtlpdtrp0(xN,X222))
| X225 = szmzizndt0(sdtlpdtrp0(xN,X222))
| aElementOf0(X225,sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( ~ aElementOf0(X226,sdtlpdtrp0(xN,X221))
| aElementOf0(X226,sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X221),sdtmndt0(sdtlpdtrp0(xN,X222),szmzizndt0(sdtlpdtrp0(xN,X222))))
| ~ epred1_2(X222,X221) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X221)),sdtlpdtrp0(xN,X221))
| ~ epred1_2(X222,X221) )
& ( ~ aElementOf0(X227,sdtlpdtrp0(xN,X221))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X221)),X227)
| ~ epred1_2(X222,X221) )
& ( aElementOf0(esk32_2(X221,X222),sdtlpdtrp0(xN,X222))
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X221)),sdtlpdtrp0(xN,X222))
| ~ epred1_2(X222,X221) )
& ( ~ sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X221)),esk32_2(X221,X222))
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X221)),sdtlpdtrp0(xN,X222))
| ~ epred1_2(X222,X221) )
& ( szmzizndt0(sdtlpdtrp0(xN,X221)) != szmzizndt0(sdtlpdtrp0(xN,X222))
| ~ epred1_2(X222,X221) ) ),
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_10])])])])])])]) ).
cnf(c_0_16,hypothesis,
( epred1_2(xj,xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2))
| ~ epred1_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( epred1_2(xj,xi)
| epred1_2(xi,xj) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_14]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
epred1_2(xi,xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM578+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n020.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 09:31:46 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.Nbfq8ANw2i/E---3.1_23637.p
% 41.60/5.78 # Version: 3.1.0
% 41.60/5.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.60/5.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.60/5.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.60/5.78 # Starting new_bool_3 with 300s (1) cores
% 41.60/5.78 # Starting new_bool_1 with 300s (1) cores
% 41.60/5.78 # Starting sh5l with 300s (1) cores
% 41.60/5.78 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23715 completed with status 0
% 41.60/5.78 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 41.60/5.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.60/5.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.60/5.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.60/5.78 # No SInE strategy applied
% 41.60/5.78 # Search class: FGHSF-SMLM32-MFFFFFNN
% 41.60/5.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 41.60/5.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 41.60/5.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 41.60/5.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 41.60/5.78 # Starting new_bool_3 with 136s (1) cores
% 41.60/5.78 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 41.60/5.78 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23722 completed with status 0
% 41.60/5.78 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 41.60/5.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.60/5.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.60/5.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.60/5.78 # No SInE strategy applied
% 41.60/5.78 # Search class: FGHSF-SMLM32-MFFFFFNN
% 41.60/5.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 41.60/5.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 41.60/5.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 41.60/5.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 41.60/5.78 # Preprocessing time : 0.121 s
% 41.60/5.78 # Presaturation interreduction done
% 41.60/5.78
% 41.60/5.78 # Proof found!
% 41.60/5.78 # SZS status Theorem
% 41.60/5.78 # SZS output start CNFRefutation
% See solution above
% 41.60/5.78 # Parsed axioms : 86
% 41.60/5.78 # Removed by relevancy pruning/SinE : 0
% 41.60/5.78 # Initial clauses : 4205
% 41.60/5.78 # Removed in clause preprocessing : 7
% 41.60/5.78 # Initial clauses in saturation : 4198
% 41.60/5.78 # Processed clauses : 6107
% 41.60/5.78 # ...of these trivial : 2
% 41.60/5.78 # ...subsumed : 594
% 41.60/5.78 # ...remaining for further processing : 5511
% 41.60/5.78 # Other redundant clauses eliminated : 1940
% 41.60/5.78 # Clauses deleted for lack of memory : 0
% 41.60/5.78 # Backward-subsumed : 0
% 41.60/5.78 # Backward-rewritten : 4
% 41.60/5.78 # Generated clauses : 2242
% 41.60/5.78 # ...of the previous two non-redundant : 2226
% 41.60/5.78 # ...aggressively subsumed : 0
% 41.60/5.78 # Contextual simplify-reflections : 38
% 41.60/5.78 # Paramodulations : 495
% 41.60/5.78 # Factorizations : 0
% 41.60/5.78 # NegExts : 0
% 41.60/5.78 # Equation resolutions : 1941
% 41.60/5.78 # Disequality decompositions : 0
% 41.60/5.78 # Total rewrite steps : 143
% 41.60/5.78 # ...of those cached : 106
% 41.60/5.78 # Propositional unsat checks : 2
% 41.60/5.78 # Propositional check models : 2
% 41.60/5.78 # Propositional check unsatisfiable : 0
% 41.60/5.78 # Propositional clauses : 0
% 41.60/5.78 # Propositional clauses after purity: 0
% 41.60/5.78 # Propositional unsat core size : 0
% 41.60/5.78 # Propositional preprocessing time : 0.000
% 41.60/5.78 # Propositional encoding time : 0.035
% 41.60/5.78 # Propositional solver time : 0.001
% 41.60/5.78 # Success case prop preproc time : 0.000
% 41.60/5.78 # Success case prop encoding time : 0.000
% 41.60/5.78 # Success case prop solver time : 0.000
% 41.60/5.78 # Current number of processed clauses : 153
% 41.60/5.78 # Positive orientable unit clauses : 86
% 41.60/5.78 # Positive unorientable unit clauses: 0
% 41.60/5.78 # Negative unit clauses : 11
% 41.60/5.78 # Non-unit-clauses : 56
% 41.60/5.78 # Current number of unprocessed clauses: 3925
% 41.60/5.78 # ...number of literals in the above : 42274
% 41.60/5.78 # Current number of archived formulas : 0
% 41.60/5.78 # Current number of archived clauses : 3612
% 41.60/5.78 # Clause-clause subsumption calls (NU) : 5466923
% 41.60/5.78 # Rec. Clause-clause subsumption calls : 78692
% 41.60/5.78 # Non-unit clause-clause subsumptions : 627
% 41.60/5.78 # Unit Clause-clause subsumption calls : 1116
% 41.60/5.78 # Rewrite failures with RHS unbound : 0
% 41.60/5.78 # BW rewrite match attempts : 175
% 41.60/5.78 # BW rewrite match successes : 4
% 41.60/5.78 # Condensation attempts : 0
% 41.60/5.78 # Condensation successes : 0
% 41.60/5.78 # Termbank termtop insertions : 787901
% 41.60/5.78 # Search garbage collected termcells : 27192
% 41.60/5.78
% 41.60/5.78 # -------------------------------------------------
% 41.60/5.78 # User time : 5.291 s
% 41.60/5.78 # System time : 0.034 s
% 41.60/5.78 # Total time : 5.325 s
% 41.60/5.78 # Maximum resident set size: 13408 pages
% 41.60/5.78
% 41.60/5.78 # -------------------------------------------------
% 41.60/5.78 # User time : 25.490 s
% 41.60/5.78 # System time : 0.101 s
% 41.60/5.78 # Total time : 25.591 s
% 41.60/5.78 # Maximum resident set size: 1828 pages
% 41.60/5.78 % E---3.1 exiting
% 41.60/5.78 % E exiting
%------------------------------------------------------------------------------