TSTP Solution File: NUN059+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUN059+1 : TPTP v8.1.2. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 19:09:06 EDT 2023
% Result : Theorem 0.16s 0.63s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 67 ( 21 unt; 0 def)
% Number of atoms : 244 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 319 ( 142 ~; 122 |; 53 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 180 ( 9 sgn; 80 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_10,axiom,
! [X26,X27,X28,X29,X30,X31] :
( ~ id(X26,X29)
| ~ id(X27,X30)
| ~ id(X28,X31)
| ( ~ r3(X26,X27,X28)
& ~ r3(X29,X30,X31) )
| ( r3(X26,X27,X28)
& r3(X29,X30,X31) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_10) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_8) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_4a) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_1) ).
fof(axiom_11,axiom,
! [X32,X33,X34,X35,X36,X37] :
( ~ id(X32,X35)
| ~ id(X33,X36)
| ~ id(X34,X37)
| ( ~ r4(X32,X33,X34)
& ~ r4(X35,X36,X37) )
| ( r4(X32,X33,X34)
& r4(X35,X36,X37) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_11) ).
fof(axiom_5a,axiom,
! [X57] :
? [X58] :
( ? [X59] :
( r1(X59)
& r4(X57,X59,X58) )
& ? [X60] :
( id(X58,X60)
& r1(X60) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_5a) ).
fof(axiom_4,axiom,
! [X10,X11] :
? [X12] :
! [X13] :
( ( id(X13,X12)
& r4(X10,X11,X13) )
| ( ~ r4(X10,X11,X13)
& ~ id(X13,X12) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_4) ).
fof(axiom_7,axiom,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_7) ).
fof(fermattothepoweroftwoid,conjecture,
? [X63,X47,X46,X40] :
( ? [X41] :
( id(X40,X41)
& r4(X46,X46,X41) )
& ? [X49] :
( r4(X47,X47,X49)
& ? [X43] :
( r4(X63,X63,X43)
& r3(X43,X49,X40) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',fermattothepoweroftwoid) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox/tmp/tmp.Doacu0vcA6/E---3.1_29421.p',axiom_5) ).
fof(c_0_10,plain,
! [X26,X27,X28,X29,X30,X31] :
( ~ id(X26,X29)
| ~ id(X27,X30)
| ~ id(X28,X31)
| ( ~ r3(X26,X27,X28)
& ~ r3(X29,X30,X31) )
| ( r3(X26,X27,X28)
& r3(X29,X30,X31) ) ),
inference(fof_simplification,[status(thm)],[axiom_10]) ).
fof(c_0_11,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
fof(c_0_12,plain,
! [X79,X80,X81,X82,X83,X84] :
( ( r3(X79,X80,X81)
| ~ r3(X79,X80,X81)
| ~ id(X79,X82)
| ~ id(X80,X83)
| ~ id(X81,X84) )
& ( r3(X82,X83,X84)
| ~ r3(X79,X80,X81)
| ~ id(X79,X82)
| ~ id(X80,X83)
| ~ id(X81,X84) )
& ( r3(X79,X80,X81)
| ~ r3(X82,X83,X84)
| ~ id(X79,X82)
| ~ id(X80,X83)
| ~ id(X81,X84) )
& ( r3(X82,X83,X84)
| ~ r3(X82,X83,X84)
| ~ id(X79,X82)
| ~ id(X80,X83)
| ~ id(X81,X84) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_13,plain,
! [X97] :
( id(esk10_1(X97),X97)
& r1(esk11_1(X97))
& r3(X97,esk11_1(X97),esk10_1(X97)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_14,plain,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_15,plain,
! [X32,X33,X34,X35,X36,X37] :
( ~ id(X32,X35)
| ~ id(X33,X36)
| ~ id(X34,X37)
| ( ~ r4(X32,X33,X34)
& ~ r4(X35,X36,X37) )
| ( r4(X32,X33,X34)
& r4(X35,X36,X37) ) ),
inference(fof_simplification,[status(thm)],[axiom_11]) ).
fof(c_0_16,plain,
! [X140,X141] :
( ( r1(X140)
| ~ r1(X140)
| ~ id(X140,X141) )
& ( r1(X141)
| ~ r1(X140)
| ~ id(X140,X141) )
& ( r1(X140)
| ~ r1(X141)
| ~ id(X140,X141) )
& ( r1(X141)
| ~ r1(X141)
| ~ id(X140,X141) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
fof(c_0_17,plain,
! [X110] :
( r1(esk14_1(X110))
& r4(X110,esk14_1(X110),esk13_1(X110))
& id(esk13_1(X110),esk15_1(X110))
& r1(esk15_1(X110)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
fof(c_0_18,plain,
! [X10,X11] :
? [X12] :
! [X13] :
( ( id(X13,X12)
& r4(X10,X11,X13) )
| ( ~ r4(X10,X11,X13)
& ~ id(X13,X12) ) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_19,plain,
( r3(X1,X2,X3)
| ~ r3(X4,X5,X6)
| ~ id(X4,X1)
| ~ id(X5,X2)
| ~ id(X6,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X139] :
( ( ~ r1(X139)
| id(X139,esk20_0) )
& ( ~ id(X139,esk20_0)
| id(X139,esk20_0) )
& ( ~ r1(X139)
| r1(X139) )
& ( ~ id(X139,esk20_0)
| r1(X139) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])]) ).
fof(c_0_22,plain,
! [X104,X105,X106,X107,X108,X109] :
( ( r4(X104,X105,X106)
| ~ r4(X104,X105,X106)
| ~ id(X104,X107)
| ~ id(X105,X108)
| ~ id(X106,X109) )
& ( r4(X107,X108,X109)
| ~ r4(X104,X105,X106)
| ~ id(X104,X107)
| ~ id(X105,X108)
| ~ id(X106,X109) )
& ( r4(X104,X105,X106)
| ~ r4(X107,X108,X109)
| ~ id(X104,X107)
| ~ id(X105,X108)
| ~ id(X106,X109) )
& ( r4(X107,X108,X109)
| ~ r4(X107,X108,X109)
| ~ id(X104,X107)
| ~ id(X105,X108)
| ~ id(X106,X109) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_23,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
id(esk13_1(X1),esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
r1(esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
fof(c_0_27,negated_conjecture,
~ ? [X63,X47,X46,X40] :
( ? [X41] :
( id(X40,X41)
& r4(X46,X46,X41) )
& ? [X49] :
( r4(X47,X47,X49)
& ? [X43] :
( r4(X63,X63,X43)
& r3(X43,X49,X40) ) ) ),
inference(assume_negation,[status(cth)],[fermattothepoweroftwoid]) ).
fof(c_0_28,plain,
! [X100,X101,X103] :
( ( ~ r4(X100,X101,X103)
| id(X103,esk12_2(X100,X101)) )
& ( ~ id(X103,esk12_2(X100,X101))
| id(X103,esk12_2(X100,X101)) )
& ( ~ r4(X100,X101,X103)
| r4(X100,X101,X103) )
& ( ~ id(X103,esk12_2(X100,X101))
| r4(X100,X101,X103) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])]) ).
fof(c_0_29,plain,
! [X114] : id(X114,X114),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_30,plain,
( r3(X1,X2,X3)
| ~ id(esk10_1(X4),X3)
| ~ id(esk11_1(X4),X2)
| ~ id(X4,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,plain,
id(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,plain,
( id(X1,esk20_0)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
( r4(X1,X2,X3)
| ~ r4(X4,X5,X6)
| ~ id(X4,X1)
| ~ id(X5,X2)
| ~ id(X6,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
r4(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_36,plain,
r1(esk13_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_37,plain,
! [X117,X118,X119] :
( ~ id(X117,X118)
| id(X117,X119)
| ~ id(X118,X119) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_38,negated_conjecture,
! [X68,X69,X70,X71,X72,X73,X74] :
( ~ id(X71,X72)
| ~ r4(X70,X70,X72)
| ~ r4(X69,X69,X73)
| ~ r4(X68,X68,X74)
| ~ r3(X74,X73,X71) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
cnf(c_0_39,plain,
( r4(X2,X3,X1)
| ~ id(X1,esk12_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( r3(X1,X2,X3)
| ~ id(esk11_1(X3),X2)
| ~ id(X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_42,plain,
id(esk11_1(X1),esk20_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_43,plain,
( ~ epred2_0
<=> ! [X2,X4,X3] :
( ~ id(esk12_2(X4,X4),X3)
| ~ r4(X2,X2,X3) ) ),
introduced(definition) ).
cnf(c_0_44,plain,
( r4(X1,X2,X3)
| ~ id(esk13_1(X4),X3)
| ~ id(esk14_1(X4),X2)
| ~ id(X4,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
id(esk13_1(X1),esk20_0),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_46,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_47,plain,
( id(X1,X3)
| ~ id(X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,negated_conjecture,
( ~ id(X1,X2)
| ~ r4(X3,X3,X2)
| ~ r4(X4,X4,X5)
| ~ r4(X6,X6,X7)
| ~ r3(X7,X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
r4(X1,X2,esk12_2(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,plain,
( r3(X1,esk20_0,X2)
| ~ id(X2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( epred2_0
| ~ r4(X1,X1,X2)
| ~ id(esk12_2(X3,X3),X2) ),
inference(split_equiv,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
( r4(X1,X2,esk20_0)
| ~ id(esk14_1(X3),X2)
| ~ id(X3,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,plain,
id(esk14_1(X1),esk20_0),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_54,plain,
( id(X1,X2)
| ~ id(X1,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_31]) ).
fof(c_0_55,plain,
( ~ epred1_0
<=> ! [X1] : ~ r4(X1,X1,esk20_0) ),
introduced(definition) ).
cnf(c_0_56,negated_conjecture,
( ~ r4(X1,X1,X2)
| ~ r4(X3,X3,X4)
| ~ r3(esk12_2(X5,X5),X2,X6)
| ~ id(X6,X4) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
r3(X1,esk20_0,X1),
inference(spm,[status(thm)],[c_0_50,c_0_40]) ).
cnf(c_0_58,negated_conjecture,
( epred2_0
| ~ r4(X1,X1,esk12_2(X2,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
cnf(c_0_59,plain,
( r4(X1,esk20_0,esk20_0)
| ~ id(X2,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
id(esk10_1(esk10_1(X1)),X1),
inference(spm,[status(thm)],[c_0_54,c_0_31]) ).
cnf(c_0_61,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55]),c_0_43]) ).
cnf(c_0_62,negated_conjecture,
epred2_0,
inference(spm,[status(thm)],[c_0_58,c_0_49]) ).
cnf(c_0_63,negated_conjecture,
( epred1_0
| ~ r4(X1,X1,esk20_0) ),
inference(split_equiv,[status(thm)],[c_0_55]) ).
cnf(c_0_64,plain,
r4(X1,esk20_0,esk20_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUN059+1 : TPTP v8.1.2. Bugfixed v7.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n006.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 : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 20:45:40 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.Doacu0vcA6/E---3.1_29421.p
% 0.16/0.63 # Version: 3.1pre001
% 0.16/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # Starting sh5l with 300s (1) cores
% 0.16/0.63 # new_bool_1 with pid 29529 completed with status 0
% 0.16/0.63 # Result found by new_bool_1
% 0.16/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.63 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.16/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.63 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.16/0.63 # H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with pid 29541 completed with status 0
% 0.16/0.63 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 0.16/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.63 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.16/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.63 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.16/0.63 # Preprocessing time : 0.001 s
% 0.16/0.63
% 0.16/0.63 # Proof found!
% 0.16/0.63 # SZS status Theorem
% 0.16/0.63 # SZS output start CNFRefutation
% See solution above
% 0.16/0.63 # Parsed axioms : 19
% 0.16/0.63 # Removed by relevancy pruning/SinE : 0
% 0.16/0.63 # Initial clauses : 59
% 0.16/0.63 # Removed in clause preprocessing : 16
% 0.16/0.63 # Initial clauses in saturation : 43
% 0.16/0.63 # Processed clauses : 1671
% 0.16/0.63 # ...of these trivial : 152
% 0.16/0.63 # ...subsumed : 385
% 0.16/0.63 # ...remaining for further processing : 1134
% 0.16/0.63 # Other redundant clauses eliminated : 0
% 0.16/0.63 # Clauses deleted for lack of memory : 0
% 0.16/0.63 # Backward-subsumed : 22
% 0.16/0.63 # Backward-rewritten : 23
% 0.16/0.63 # Generated clauses : 20132
% 0.16/0.63 # ...of the previous two non-redundant : 18403
% 0.16/0.63 # ...aggressively subsumed : 0
% 0.16/0.63 # Contextual simplify-reflections : 0
% 0.16/0.63 # Paramodulations : 20063
% 0.16/0.63 # Factorizations : 0
% 0.16/0.63 # NegExts : 0
% 0.16/0.63 # Equation resolutions : 0
% 0.16/0.63 # Total rewrite steps : 2149
% 0.16/0.63 # Propositional unsat checks : 0
% 0.16/0.63 # Propositional check models : 0
% 0.16/0.63 # Propositional check unsatisfiable : 0
% 0.16/0.63 # Propositional clauses : 0
% 0.16/0.63 # Propositional clauses after purity: 0
% 0.16/0.63 # Propositional unsat core size : 0
% 0.16/0.63 # Propositional preprocessing time : 0.000
% 0.16/0.63 # Propositional encoding time : 0.000
% 0.16/0.63 # Propositional solver time : 0.000
% 0.16/0.63 # Success case prop preproc time : 0.000
% 0.16/0.63 # Success case prop encoding time : 0.000
% 0.16/0.63 # Success case prop solver time : 0.000
% 0.16/0.63 # Current number of processed clauses : 1043
% 0.16/0.63 # Positive orientable unit clauses : 368
% 0.16/0.63 # Positive unorientable unit clauses: 0
% 0.16/0.63 # Negative unit clauses : 72
% 0.16/0.63 # Non-unit-clauses : 603
% 0.16/0.63 # Current number of unprocessed clauses: 16736
% 0.16/0.63 # ...number of literals in the above : 21780
% 0.16/0.63 # Current number of archived formulas : 0
% 0.16/0.63 # Current number of archived clauses : 45
% 0.16/0.63 # Clause-clause subsumption calls (NU) : 35437
% 0.16/0.63 # Rec. Clause-clause subsumption calls : 24567
% 0.16/0.63 # Non-unit clause-clause subsumptions : 362
% 0.16/0.63 # Unit Clause-clause subsumption calls : 13030
% 0.16/0.63 # Rewrite failures with RHS unbound : 0
% 0.16/0.63 # BW rewrite match attempts : 776
% 0.16/0.63 # BW rewrite match successes : 15
% 0.16/0.63 # Condensation attempts : 0
% 0.16/0.63 # Condensation successes : 0
% 0.16/0.63 # Termbank termtop insertions : 197327
% 0.16/0.63
% 0.16/0.63 # -------------------------------------------------
% 0.16/0.63 # User time : 0.193 s
% 0.16/0.63 # System time : 0.010 s
% 0.16/0.63 # Total time : 0.203 s
% 0.16/0.63 # Maximum resident set size: 1904 pages
% 0.16/0.63
% 0.16/0.63 # -------------------------------------------------
% 0.16/0.63 # User time : 0.195 s
% 0.16/0.63 # System time : 0.012 s
% 0.16/0.63 # Total time : 0.207 s
% 0.16/0.63 # Maximum resident set size: 1748 pages
% 0.16/0.63 % E---3.1 exiting
% 0.16/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------