TSTP Solution File: NUM631+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM631+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Tue May 21 01:27:20 EDT 2024
% Result : Theorem 49.90s 6.82s
% Output : CNFRefutation 49.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 20 unt; 0 def)
% Number of atoms : 167 ( 53 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 175 ( 49 ~; 49 |; 61 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 13 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5164,hypothesis,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& X1 != szmzizndt0(xQ) ) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(m__5147,hypothesis,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& xp = szmzizndt0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(mConsDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mConsDiff) ).
fof(m__5078,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(m__4730,hypothesis,
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSet0(X2)
& ( ( ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1))) )
| aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) )
& sbrdtbr0(X2) = xk )
| aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) ) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(m__5334,hypothesis,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5334) ).
fof(m__,conjecture,
sdtlpdtrp0(xc,xQ) = sdtlpdtrp0(xd,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__5632,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xn))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xn)),X1) )
& aSet0(sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xP)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xn)) ) ) )
& sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5632) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,szDzozmdt0(xd))
& sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(m__5217,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5217) ).
fof(c_0_11,hypothesis,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& X1 != szmzizndt0(xQ) ) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
inference(fof_simplification,[status(thm)],[m__5164]) ).
fof(c_0_12,hypothesis,
! [X262,X263] :
( aSet0(xP)
& ( ~ aElementOf0(X262,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X262) )
& ( aElement0(X263)
| ~ aElementOf0(X263,xP) )
& ( aElementOf0(X263,xQ)
| ~ aElementOf0(X263,xP) )
& ( X263 != szmzizndt0(xQ)
| ~ aElementOf0(X263,xP) )
& ( ~ aElement0(X263)
| ~ aElementOf0(X263,xQ)
| X263 = szmzizndt0(xQ)
| aElementOf0(X263,xP) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
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_13,hypothesis,
! [X261] :
( aElementOf0(xp,xQ)
& ( ~ aElementOf0(X261,xQ)
| sdtlseqdt0(xp,X261) )
& xp = szmzizndt0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])])]) ).
fof(c_0_14,hypothesis,
! [X235,X236] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( aElementOf0(sdtlpdtrp0(xe,X235),sdtlpdtrp0(xN,X235))
| ~ aElementOf0(X235,szNzAzT0) )
& ( ~ aElementOf0(X236,sdtlpdtrp0(xN,X235))
| sdtlseqdt0(sdtlpdtrp0(xe,X235),X236)
| ~ aElementOf0(X235,szNzAzT0) )
& ( sdtlpdtrp0(xe,X235) = szmzizndt0(sdtlpdtrp0(xN,X235))
| ~ aElementOf0(X235,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])])]) ).
fof(c_0_15,plain,
! [X47,X48] :
( ~ aSet0(X47)
| ~ aElementOf0(X48,X47)
| sdtpldt0(sdtmndt0(X47,X48),X48) = X47 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mConsDiff])])])]) ).
cnf(c_0_16,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,hypothesis,
! [X255] :
( aSet0(xQ)
& ( ~ aElementOf0(X255,xQ)
| aElementOf0(X255,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_19,hypothesis,
! [X237,X238] :
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ( aElementOf0(esk36_2(X237,X238),X238)
| sbrdtbr0(X238) != xk
| ~ aSet0(X238)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aElementOf0(X237,szNzAzT0) )
& ( ~ aElementOf0(esk36_2(X237,X238),sdtlpdtrp0(xN,szszuzczcdt0(X237)))
| sbrdtbr0(X238) != xk
| ~ aSet0(X238)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aElementOf0(X237,szNzAzT0) )
& ( ~ aSubsetOf0(X238,sdtlpdtrp0(xN,szszuzczcdt0(X237)))
| sbrdtbr0(X238) != xk
| ~ aSet0(X238)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aElementOf0(X237,szNzAzT0) )
& ( ~ aElementOf0(X238,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X237)),xk))
| ~ aSet0(X238)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aElementOf0(X237,szNzAzT0) ) ),
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)],[m__4730])])])])])]) ).
fof(c_0_20,hypothesis,
! [X267] :
( ( ~ aElementOf0(X267,xP)
| aElementOf0(X267,sdtlpdtrp0(xN,szszuzczcdt0(xn))) )
& aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5334])])])]) ).
fof(c_0_21,negated_conjecture,
sdtlpdtrp0(xc,xQ) != sdtlpdtrp0(xd,xn),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_22,hypothesis,
! [X271,X272] :
( ( ~ aElementOf0(X271,sdtlpdtrp0(xN,xn))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xn)),X271) )
& aSet0(sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))
& ( aElement0(X272)
| ~ aElementOf0(X272,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) )
& ( aElementOf0(X272,xP)
| X272 = szmzizndt0(sdtlpdtrp0(xN,xn))
| ~ aElementOf0(X272,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) )
& ( ~ aElementOf0(X272,xP)
| ~ aElement0(X272)
| aElementOf0(X272,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) )
& ( X272 != szmzizndt0(sdtlpdtrp0(xN,xn))
| ~ aElement0(X272)
| aElementOf0(X272,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) )
& sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5632])])])])]) ).
cnf(c_0_23,hypothesis,
( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_25,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_26,plain,
( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_29,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,hypothesis,
( sdtlpdtrp0(xd,X2) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1)
| ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| sbrdtbr0(X1) != xk
| ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,hypothesis,
aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[m__5217]) ).
cnf(c_0_33,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_34,negated_conjecture,
sdtlpdtrp0(xc,xQ) != sdtlpdtrp0(xd,xn),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_35,hypothesis,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xn)) = xp,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_37,hypothesis,
sdtpldt0(xP,xp) = xQ,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_38,hypothesis,
sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP) = sdtlpdtrp0(xd,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
sdtlpdtrp0(xc,xQ) != sdtlpdtrp0(xd,xn),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : NUM631+3 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 06:58:22 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 49.90/6.82 # Version: 3.1.0
% 49.90/6.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.90/6.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.90/6.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.90/6.82 # Starting new_bool_3 with 300s (1) cores
% 49.90/6.82 # Starting new_bool_1 with 300s (1) cores
% 49.90/6.82 # Starting sh5l with 300s (1) cores
% 49.90/6.82 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16250 completed with status 0
% 49.90/6.82 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 49.90/6.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.90/6.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.90/6.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.90/6.82 # No SInE strategy applied
% 49.90/6.82 # Search class: FGHSF-SMLM32-MFFFFFNN
% 49.90/6.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 49.90/6.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 49.90/6.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 49.90/6.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 49.90/6.82 # Starting new_bool_3 with 136s (1) cores
% 49.90/6.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 49.90/6.82 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16259 completed with status 0
% 49.90/6.82 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 49.90/6.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.90/6.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.90/6.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.90/6.82 # No SInE strategy applied
% 49.90/6.82 # Search class: FGHSF-SMLM32-MFFFFFNN
% 49.90/6.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 49.90/6.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 49.90/6.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 49.90/6.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 49.90/6.82 # Preprocessing time : 0.135 s
% 49.90/6.82 # Presaturation interreduction done
% 49.90/6.82
% 49.90/6.82 # Proof found!
% 49.90/6.82 # SZS status Theorem
% 49.90/6.82 # SZS output start CNFRefutation
% See solution above
% 49.90/6.82 # Parsed axioms : 117
% 49.90/6.82 # Removed by relevancy pruning/SinE : 0
% 49.90/6.82 # Initial clauses : 4936
% 49.90/6.82 # Removed in clause preprocessing : 7
% 49.90/6.82 # Initial clauses in saturation : 4929
% 49.90/6.82 # Processed clauses : 7916
% 49.90/6.82 # ...of these trivial : 34
% 49.90/6.82 # ...subsumed : 980
% 49.90/6.82 # ...remaining for further processing : 6902
% 49.90/6.82 # Other redundant clauses eliminated : 2045
% 49.90/6.82 # Clauses deleted for lack of memory : 0
% 49.90/6.82 # Backward-subsumed : 17
% 49.90/6.82 # Backward-rewritten : 45
% 49.90/6.82 # Generated clauses : 5229
% 49.90/6.82 # ...of the previous two non-redundant : 4866
% 49.90/6.82 # ...aggressively subsumed : 0
% 49.90/6.82 # Contextual simplify-reflections : 78
% 49.90/6.82 # Paramodulations : 3381
% 49.90/6.82 # Factorizations : 0
% 49.90/6.82 # NegExts : 0
% 49.90/6.82 # Equation resolutions : 2048
% 49.90/6.82 # Disequality decompositions : 0
% 49.90/6.82 # Total rewrite steps : 2713
% 49.90/6.82 # ...of those cached : 2407
% 49.90/6.82 # Propositional unsat checks : 2
% 49.90/6.82 # Propositional check models : 2
% 49.90/6.82 # Propositional check unsatisfiable : 0
% 49.90/6.82 # Propositional clauses : 0
% 49.90/6.82 # Propositional clauses after purity: 0
% 49.90/6.82 # Propositional unsat core size : 0
% 49.90/6.82 # Propositional preprocessing time : 0.000
% 49.90/6.82 # Propositional encoding time : 0.038
% 49.90/6.82 # Propositional solver time : 0.001
% 49.90/6.82 # Success case prop preproc time : 0.000
% 49.90/6.82 # Success case prop encoding time : 0.000
% 49.90/6.82 # Success case prop solver time : 0.000
% 49.90/6.82 # Current number of processed clauses : 977
% 49.90/6.82 # Positive orientable unit clauses : 547
% 49.90/6.82 # Positive unorientable unit clauses: 0
% 49.90/6.82 # Negative unit clauses : 52
% 49.90/6.82 # Non-unit-clauses : 378
% 49.90/6.82 # Current number of unprocessed clauses: 5893
% 49.90/6.82 # ...number of literals in the above : 48318
% 49.90/6.82 # Current number of archived formulas : 0
% 49.90/6.82 # Current number of archived clauses : 4080
% 49.90/6.82 # Clause-clause subsumption calls (NU) : 9100562
% 49.90/6.82 # Rec. Clause-clause subsumption calls : 84159
% 49.90/6.82 # Non-unit clause-clause subsumptions : 1011
% 49.90/6.82 # Unit Clause-clause subsumption calls : 15861
% 49.90/6.82 # Rewrite failures with RHS unbound : 0
% 49.90/6.82 # BW rewrite match attempts : 153
% 49.90/6.82 # BW rewrite match successes : 21
% 49.90/6.82 # Condensation attempts : 0
% 49.90/6.82 # Condensation successes : 0
% 49.90/6.82 # Termbank termtop insertions : 904143
% 49.90/6.82 # Search garbage collected termcells : 32169
% 49.90/6.82
% 49.90/6.82 # -------------------------------------------------
% 49.90/6.82 # User time : 6.336 s
% 49.90/6.82 # System time : 0.039 s
% 49.90/6.82 # Total time : 6.375 s
% 49.90/6.82 # Maximum resident set size: 14376 pages
% 49.90/6.82
% 49.90/6.82 # -------------------------------------------------
% 49.90/6.82 # User time : 30.446 s
% 49.90/6.82 # System time : 0.120 s
% 49.90/6.82 # Total time : 30.566 s
% 49.90/6.82 # Maximum resident set size: 1892 pages
% 49.90/6.82 % E---3.1 exiting
%------------------------------------------------------------------------------