TSTP Solution File: SET645+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET645+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:20:06 EDT 2023
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 194 ( 0 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 243 ( 94 ~; 89 |; 23 &)
% ( 5 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 87 ( 6 sgn; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p4,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) )
& ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p4) ).
fof(p21,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p21) ).
fof(prove_relset_1_7,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ! [X5] :
( ilf_type(X5,relation_type(X1,X2))
=> ( member(ordered_pair(X3,X4),X5)
=> ( member(X3,X1)
& member(X4,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',prove_relset_1_7) ).
fof(p15,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ~ empty(X2)
& ilf_type(X2,set_type) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p15) ).
fof(p10,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p10) ).
fof(p14,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p14) ).
fof(p13,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p13) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( member(ordered_pair(X1,X2),cross_product(X3,X4))
<=> ( member(X1,X3)
& member(X2,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FtJWd1aMuj/E---3.1_27039.p',p1) ).
fof(c_0_8,plain,
! [X17,X18,X19,X20] :
( ( ~ ilf_type(X19,subset_type(cross_product(X17,X18)))
| ilf_type(X19,relation_type(X17,X18))
| ~ ilf_type(X18,set_type)
| ~ ilf_type(X17,set_type) )
& ( ~ ilf_type(X20,relation_type(X17,X18))
| ilf_type(X20,subset_type(cross_product(X17,X18)))
| ~ ilf_type(X18,set_type)
| ~ ilf_type(X17,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p4])])])]) ).
fof(c_0_9,plain,
! [X62] : ilf_type(X62,set_type),
inference(variable_rename,[status(thm)],[p21]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ! [X5] :
( ilf_type(X5,relation_type(X1,X2))
=> ( member(ordered_pair(X3,X4),X5)
=> ( member(X3,X1)
& member(X4,X2) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_7]) ).
fof(c_0_11,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ~ empty(X2)
& ilf_type(X2,set_type) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[p15]) ).
fof(c_0_12,plain,
! [X31,X32] :
( ( ~ ilf_type(X32,subset_type(X31))
| ilf_type(X32,member_type(power_set(X31)))
| ~ ilf_type(X32,set_type)
| ~ ilf_type(X31,set_type) )
& ( ~ ilf_type(X32,member_type(power_set(X31)))
| ilf_type(X32,subset_type(X31))
| ~ ilf_type(X32,set_type)
| ~ ilf_type(X31,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p10])])])]) ).
cnf(c_0_13,plain,
( ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,negated_conjecture,
( ilf_type(esk10_0,set_type)
& ilf_type(esk11_0,set_type)
& ilf_type(esk12_0,set_type)
& ilf_type(esk13_0,set_type)
& ilf_type(esk14_0,relation_type(esk10_0,esk11_0))
& member(ordered_pair(esk12_0,esk13_0),esk14_0)
& ( ~ member(esk12_0,esk10_0)
| ~ member(esk13_0,esk11_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
inference(fof_simplification,[status(thm)],[p14]) ).
fof(c_0_17,plain,
! [X39,X40,X41] :
( ( ~ member(X39,power_set(X40))
| ~ ilf_type(X41,set_type)
| ~ member(X41,X39)
| member(X41,X40)
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( ilf_type(esk4_2(X39,X40),set_type)
| member(X39,power_set(X40))
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( member(esk4_2(X39,X40),X39)
| member(X39,power_set(X40))
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( ~ member(esk4_2(X39,X40),X40)
| member(X39,power_set(X40))
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p13])])])])]) ).
fof(c_0_18,plain,
! [X44,X45] :
( ( ~ ilf_type(X44,member_type(X45))
| member(X44,X45)
| empty(X45)
| ~ ilf_type(X45,set_type)
| ~ ilf_type(X44,set_type) )
& ( ~ member(X44,X45)
| ilf_type(X44,member_type(X45))
| empty(X45)
| ~ ilf_type(X45,set_type)
| ~ ilf_type(X44,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_19,plain,
( ilf_type(X1,member_type(power_set(X2)))
| ~ ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X1,relation_type(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
ilf_type(esk14_0,relation_type(esk10_0,esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X43] :
( ( ~ empty(power_set(X43))
| ~ ilf_type(X43,set_type) )
& ( ilf_type(power_set(X43),set_type)
| ~ ilf_type(X43,set_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_23,plain,
( member(X3,X2)
| ~ member(X1,power_set(X2))
| ~ ilf_type(X3,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( member(X1,X2)
| empty(X2)
| ~ ilf_type(X1,member_type(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ilf_type(X1,member_type(power_set(X2)))
| ~ ilf_type(X1,subset_type(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14]),c_0_14])]) ).
cnf(c_0_26,negated_conjecture,
ilf_type(esk14_0,subset_type(cross_product(esk10_0,esk11_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ empty(power_set(X1))
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X6,X7,X8,X9] :
( ( member(X6,X8)
| ~ member(ordered_pair(X6,X7),cross_product(X8,X9))
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type) )
& ( member(X7,X9)
| ~ member(ordered_pair(X6,X7),cross_product(X8,X9))
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type) )
& ( ~ member(X6,X8)
| ~ member(X7,X9)
| member(ordered_pair(X6,X7),cross_product(X8,X9))
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])]) ).
cnf(c_0_29,plain,
( member(X1,X2)
| ~ member(X3,power_set(X2))
| ~ member(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_14]),c_0_14]),c_0_14])]) ).
cnf(c_0_30,negated_conjecture,
member(ordered_pair(esk12_0,esk13_0),esk14_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,plain,
( empty(X1)
| member(X2,X1)
| ~ ilf_type(X2,member_type(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_14]),c_0_14])]) ).
cnf(c_0_32,negated_conjecture,
ilf_type(esk14_0,member_type(power_set(cross_product(esk10_0,esk11_0)))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_14])]) ).
cnf(c_0_34,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( member(ordered_pair(esk12_0,esk13_0),X1)
| ~ member(esk14_0,power_set(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
member(esk14_0,power_set(cross_product(esk10_0,esk11_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_14]),c_0_14]),c_0_14]),c_0_14])]) ).
cnf(c_0_38,negated_conjecture,
member(ordered_pair(esk12_0,esk13_0),cross_product(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X3,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(esk12_0,esk10_0)
| ~ member(esk13_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
member(esk12_0,esk10_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( member(X1,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_14]),c_0_14]),c_0_14]),c_0_14])]) ).
cnf(c_0_43,negated_conjecture,
~ member(esk13_0,esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_38]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SET645+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 16:28:44 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.FtJWd1aMuj/E---3.1_27039.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27117 completed with status 0
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.18/0.48 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.18/0.48 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 27121 completed with status 0
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 22
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 49
% 0.18/0.48 # Removed in clause preprocessing : 2
% 0.18/0.48 # Initial clauses in saturation : 47
% 0.18/0.48 # Processed clauses : 133
% 0.18/0.48 # ...of these trivial : 12
% 0.18/0.48 # ...subsumed : 16
% 0.18/0.48 # ...remaining for further processing : 104
% 0.18/0.48 # Other redundant clauses eliminated : 1
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 5
% 0.18/0.48 # Generated clauses : 113
% 0.18/0.48 # ...of the previous two non-redundant : 93
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 1
% 0.18/0.48 # Paramodulations : 112
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 1
% 0.18/0.48 # Total rewrite steps : 119
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 67
% 0.18/0.48 # Positive orientable unit clauses : 30
% 0.18/0.48 # Positive unorientable unit clauses: 1
% 0.18/0.48 # Negative unit clauses : 5
% 0.18/0.48 # Non-unit-clauses : 31
% 0.18/0.48 # Current number of unprocessed clauses: 38
% 0.18/0.48 # ...number of literals in the above : 75
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 36
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 170
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 133
% 0.18/0.48 # Non-unit clause-clause subsumptions : 6
% 0.18/0.48 # Unit Clause-clause subsumption calls : 62
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 26
% 0.18/0.48 # BW rewrite match successes : 9
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 5391
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.009 s
% 0.18/0.48 # System time : 0.000 s
% 0.18/0.48 # Total time : 0.009 s
% 0.18/0.48 # Maximum resident set size: 1880 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.029 s
% 0.18/0.48 # System time : 0.006 s
% 0.18/0.48 # Total time : 0.035 s
% 0.18/0.48 # Maximum resident set size: 1704 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------