TSTP Solution File: COM138+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM138+1 : TPTP v8.1.2. Released v6.4.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:21:27 EDT 2023
% Result : Theorem 0.17s 0.59s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 166 ( 98 equ)
% Maximal formula atoms : 72 ( 4 avg)
% Number of connectives : 185 ( 56 ~; 89 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 106 ( 9 sgn; 58 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-Strong-var',conjecture,
! [X9,X10,X20,X21,X15] :
( ( ~ visFreeVar(X9,vvar(X21))
& vtcheck(vbind(X9,X10,X20),vvar(X21),X15) )
=> vtcheck(X20,vvar(X21),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p','T-Strong-var') ).
fof(isFreeVar0,axiom,
! [X1,X4,X9,X14] :
( ( X1 = X14
& X4 = vvar(X9) )
=> ( ( X9 = X14
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> X9 = X14 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p',isFreeVar0) ).
fof('T-inv',axiom,
! [X11,X15,X20] :
( vtcheck(X20,X11,X15)
=> ( ? [X9] :
( X11 = vvar(X9)
& vlookup(X9,X20) = vsomeType(X15) )
| ? [X9,X13,X33,X34] :
( X11 = vabs(X9,X33,X13)
& X15 = varrow(X33,X34)
& vtcheck(vbind(X9,X33,X20),X13,X34) )
| ? [X12,X13,X10] :
( X11 = vapp(X12,X13)
& vtcheck(X20,X12,varrow(X10,X15))
& vtcheck(X20,X13,X10) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p','T-inv') ).
fof('DIFF-var-abs',axiom,
! [X1,X2,X3,X4] : vvar(X1) != vabs(X2,X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p','DIFF-var-abs') ).
fof('DIFF-var-app',axiom,
! [X1,X4,X6] : vvar(X1) != vapp(X4,X6),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p','DIFF-var-app') ).
fof(lookup2,axiom,
! [X22,X21,X1,X16,X19,X9,X20] :
( ( X1 = X9
& X16 = vbind(X21,X22,X20) )
=> ( X9 != X21
=> ( X19 = vlookup(X1,X16)
=> X19 = vlookup(X9,X20) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p',lookup2) ).
fof('T-var',axiom,
! [X20,X9,X15] :
( vlookup(X9,X20) = vsomeType(X15)
=> vtcheck(X20,vvar(X9),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.lptjs2riBJ/E---3.1_698.p','T-var') ).
fof(c_0_7,negated_conjecture,
~ ! [X9,X10,X20,X21,X15] :
( ( ~ visFreeVar(X9,vvar(X21))
& vtcheck(vbind(X9,X10,X20),vvar(X21),X15) )
=> vtcheck(X20,vvar(X21),X15) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['T-Strong-var'])]) ).
fof(c_0_8,plain,
! [X68,X69,X70,X71] :
( ( X70 != X71
| visFreeVar(X68,X69)
| X68 != X71
| X69 != vvar(X70) )
& ( ~ visFreeVar(X68,X69)
| X70 = X71
| X68 != X71
| X69 != vvar(X70) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar0])])]) ).
fof(c_0_9,plain,
! [X285,X286,X287] :
( ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| X285 = vvar(esk24_3(X285,X286,X287))
| ~ vtcheck(X287,X285,X286) )
& ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| X285 = vabs(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),esk26_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| X286 = varrow(esk27_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( X285 = vapp(esk29_3(X285,X286,X287),esk30_3(X285,X286,X287))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk29_3(X285,X286,X287),varrow(esk31_3(X285,X286,X287),X286))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) )
& ( vtcheck(X287,esk30_3(X285,X286,X287),esk31_3(X285,X286,X287))
| vtcheck(vbind(esk25_3(X285,X286,X287),esk27_3(X285,X286,X287),X287),esk26_3(X285,X286,X287),esk28_3(X285,X286,X287))
| vlookup(esk24_3(X285,X286,X287),X287) = vsomeType(X286)
| ~ vtcheck(X287,X285,X286) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-inv'])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ visFreeVar(esk32_0,vvar(esk35_0))
& vtcheck(vbind(esk32_0,esk33_0,esk34_0),vvar(esk35_0),esk36_0)
& ~ vtcheck(esk34_0,vvar(esk35_0),esk36_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X47,X48,X49,X50] : vvar(X47) != vabs(X48,X49,X50),
inference(variable_rename,[status(thm)],['DIFF-var-abs']) ).
fof(c_0_12,plain,
! [X51,X52,X53] : vvar(X51) != vapp(X52,X53),
inference(variable_rename,[status(thm)],['DIFF-var-app']) ).
cnf(c_0_13,plain,
( visFreeVar(X3,X4)
| X1 != X2
| X3 != X2
| X4 != vvar(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( X1 = vapp(esk29_3(X1,X2,X3),esk30_3(X1,X2,X3))
| X1 = vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3))
| X1 = vvar(esk24_3(X1,X2,X3))
| ~ vtcheck(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
vtcheck(vbind(esk32_0,esk33_0,esk34_0),vvar(esk35_0),esk36_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
vvar(X1) != vabs(X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
vvar(X1) != vapp(X2,X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( X3 = X4
| ~ visFreeVar(X1,X2)
| X1 != X4
| X2 != vvar(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
visFreeVar(X1,vvar(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])])]) ).
cnf(c_0_20,negated_conjecture,
vvar(esk24_3(vvar(esk35_0),esk36_0,vbind(esk32_0,esk33_0,esk34_0))) = vvar(esk35_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).
fof(c_0_21,plain,
! [X112,X113,X114,X115,X116,X117,X118] :
( X114 != X117
| X115 != vbind(X113,X112,X118)
| X117 = X113
| X116 != vlookup(X114,X115)
| X116 = vlookup(X117,X118) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lookup2])]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ visFreeVar(X2,vvar(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
visFreeVar(esk24_3(vvar(esk35_0),esk36_0,vbind(esk32_0,esk33_0,esk34_0)),vvar(esk35_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( X2 = X4
| X7 = vlookup(X2,X6)
| X1 != X2
| X3 != vbind(X4,X5,X6)
| X7 != vlookup(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( X1 = vapp(esk29_3(X1,X2,X3),esk30_3(X1,X2,X3))
| X1 = vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3))
| vlookup(esk24_3(X1,X2,X3),X3) = vsomeType(X2)
| ~ vtcheck(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
esk24_3(vvar(esk35_0),esk36_0,vbind(esk32_0,esk33_0,esk34_0)) = esk35_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X272,X273,X274] :
( vlookup(X273,X272) != vsomeType(X274)
| vtcheck(X272,vvar(X273),X274) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-var'])]) ).
cnf(c_0_28,plain,
( vlookup(X1,vbind(X2,X3,X4)) = vlookup(X1,X4)
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,negated_conjecture,
vlookup(esk35_0,vbind(esk32_0,esk33_0,esk34_0)) = vsomeType(esk36_0),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16]),c_0_17]),c_0_26]) ).
cnf(c_0_30,plain,
( vtcheck(X2,vvar(X1),X3)
| vlookup(X1,X2) != vsomeType(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( vsomeType(esk36_0) = vlookup(esk35_0,esk34_0)
| esk32_0 = esk35_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( esk32_0 = esk35_0
| vtcheck(X1,vvar(X2),esk36_0)
| vlookup(X2,X1) != vlookup(esk35_0,esk34_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ vtcheck(esk34_0,vvar(esk35_0),esk36_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
~ visFreeVar(esk32_0,vvar(esk35_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
esk32_0 = esk35_0,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : COM138+1 : TPTP v8.1.2. Released v6.4.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 04:58:46 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.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/tmp/tmp.lptjs2riBJ/E---3.1_698.p
% 0.17/0.59 # Version: 3.1pre001
% 0.17/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.59 # Starting sh5l with 300s (1) cores
% 0.17/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 815 completed with status 0
% 0.17/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 # No SInE strategy applied
% 0.17/0.59 # Search class: FGHSF-FSLF32-MFFFFFNN
% 0.17/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 811s (1) cores
% 0.17/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.59 # Starting sh5l with 136s (1) cores
% 0.17/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 823 completed with status 0
% 0.17/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 # No SInE strategy applied
% 0.17/0.59 # Search class: FGHSF-FSLF32-MFFFFFNN
% 0.17/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 811s (1) cores
% 0.17/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.59 # Preprocessing time : 0.007 s
% 0.17/0.59 # Presaturation interreduction done
% 0.17/0.59
% 0.17/0.59 # Proof found!
% 0.17/0.59 # SZS status Theorem
% 0.17/0.59 # SZS output start CNFRefutation
% See solution above
% 0.17/0.59 # Parsed axioms : 56
% 0.17/0.59 # Removed by relevancy pruning/SinE : 0
% 0.17/0.59 # Initial clauses : 419
% 0.17/0.59 # Removed in clause preprocessing : 10
% 0.17/0.59 # Initial clauses in saturation : 409
% 0.17/0.59 # Processed clauses : 964
% 0.17/0.59 # ...of these trivial : 14
% 0.17/0.59 # ...subsumed : 49
% 0.17/0.59 # ...remaining for further processing : 901
% 0.17/0.59 # Other redundant clauses eliminated : 298
% 0.17/0.59 # Clauses deleted for lack of memory : 0
% 0.17/0.59 # Backward-subsumed : 0
% 0.17/0.59 # Backward-rewritten : 47
% 0.17/0.59 # Generated clauses : 2031
% 0.17/0.59 # ...of the previous two non-redundant : 1856
% 0.17/0.59 # ...aggressively subsumed : 0
% 0.17/0.59 # Contextual simplify-reflections : 0
% 0.17/0.59 # Paramodulations : 1769
% 0.17/0.59 # Factorizations : 0
% 0.17/0.59 # NegExts : 0
% 0.17/0.59 # Equation resolutions : 314
% 0.17/0.59 # Total rewrite steps : 152
% 0.17/0.59 # Propositional unsat checks : 0
% 0.17/0.59 # Propositional check models : 0
% 0.17/0.59 # Propositional check unsatisfiable : 0
% 0.17/0.59 # Propositional clauses : 0
% 0.17/0.59 # Propositional clauses after purity: 0
% 0.17/0.59 # Propositional unsat core size : 0
% 0.17/0.59 # Propositional preprocessing time : 0.000
% 0.17/0.59 # Propositional encoding time : 0.000
% 0.17/0.59 # Propositional solver time : 0.000
% 0.17/0.59 # Success case prop preproc time : 0.000
% 0.17/0.59 # Success case prop encoding time : 0.000
% 0.17/0.59 # Success case prop solver time : 0.000
% 0.17/0.59 # Current number of processed clauses : 391
% 0.17/0.59 # Positive orientable unit clauses : 25
% 0.17/0.59 # Positive unorientable unit clauses: 0
% 0.17/0.59 # Negative unit clauses : 17
% 0.17/0.59 # Non-unit-clauses : 349
% 0.17/0.59 # Current number of unprocessed clauses: 1658
% 0.17/0.59 # ...number of literals in the above : 6415
% 0.17/0.59 # Current number of archived formulas : 0
% 0.17/0.59 # Current number of archived clauses : 416
% 0.17/0.59 # Clause-clause subsumption calls (NU) : 63923
% 0.17/0.59 # Rec. Clause-clause subsumption calls : 15883
% 0.17/0.59 # Non-unit clause-clause subsumptions : 43
% 0.17/0.59 # Unit Clause-clause subsumption calls : 2432
% 0.17/0.59 # Rewrite failures with RHS unbound : 0
% 0.17/0.59 # BW rewrite match attempts : 18
% 0.17/0.59 # BW rewrite match successes : 4
% 0.17/0.59 # Condensation attempts : 0
% 0.17/0.59 # Condensation successes : 0
% 0.17/0.59 # Termbank termtop insertions : 80105
% 0.17/0.59
% 0.17/0.59 # -------------------------------------------------
% 0.17/0.59 # User time : 0.124 s
% 0.17/0.59 # System time : 0.007 s
% 0.17/0.59 # Total time : 0.131 s
% 0.17/0.59 # Maximum resident set size: 2824 pages
% 0.17/0.59
% 0.17/0.59 # -------------------------------------------------
% 0.17/0.59 # User time : 0.573 s
% 0.17/0.59 # System time : 0.018 s
% 0.17/0.59 # Total time : 0.591 s
% 0.17/0.59 # Maximum resident set size: 1800 pages
% 0.17/0.59 % E---3.1 exiting
% 0.17/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------