TSTP Solution File: SET641+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET641+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:23:13 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 8 unt; 0 def)
% Number of atoms : 189 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 238 ( 92 ~; 91 |; 18 &)
% ( 7 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 2 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p14,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hZi2bIs5Pk/E---3.1_28042.p',p14) ).
fof(p12,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.hZi2bIs5Pk/E---3.1_28042.p',p12) ).
fof(p18,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/tmp.hZi2bIs5Pk/E---3.1_28042.p',p18) ).
fof(p7,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.hZi2bIs5Pk/E---3.1_28042.p',p7) ).
fof(p1,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.hZi2bIs5Pk/E---3.1_28042.p',p1) ).
fof(p5,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hZi2bIs5Pk/E---3.1_28042.p',p5) ).
fof(prove_relset_1_3,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hZi2bIs5Pk/E---3.1_28042.p',prove_relset_1_3) ).
fof(p10,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.hZi2bIs5Pk/E---3.1_28042.p',p10) ).
fof(c_0_8,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[p14]) ).
fof(c_0_9,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)],[p12]) ).
fof(c_0_10,plain,
! [X42,X43] :
( ( ~ empty(X42)
| ~ ilf_type(X43,set_type)
| ~ member(X43,X42)
| ~ ilf_type(X42,set_type) )
& ( ilf_type(esk8_1(X42),set_type)
| empty(X42)
| ~ ilf_type(X42,set_type) )
& ( member(esk8_1(X42),X42)
| empty(X42)
| ~ ilf_type(X42,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)],[c_0_8])])])])]) ).
fof(c_0_11,plain,
! [X56] : ilf_type(X56,set_type),
inference(variable_rename,[status(thm)],[p18]) ).
fof(c_0_12,plain,
! [X28,X29] :
( ( ~ ilf_type(X29,subset_type(X28))
| ilf_type(X29,member_type(power_set(X28)))
| ~ ilf_type(X29,set_type)
| ~ ilf_type(X28,set_type) )
& ( ~ ilf_type(X29,member_type(power_set(X28)))
| ilf_type(X29,subset_type(X28))
| ~ ilf_type(X29,set_type)
| ~ ilf_type(X28,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p7])])])]) ).
fof(c_0_13,plain,
! [X38,X39] :
( ( ~ ilf_type(X38,member_type(X39))
| member(X38,X39)
| empty(X39)
| ~ ilf_type(X39,set_type)
| ~ ilf_type(X38,set_type) )
& ( ~ member(X38,X39)
| ilf_type(X38,member_type(X39))
| empty(X39)
| ~ ilf_type(X39,set_type)
| ~ ilf_type(X38,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
( ~ empty(X1)
| ~ ilf_type(X2,set_type)
| ~ member(X2,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X6,X7,X8,X9] :
( ( ~ ilf_type(X8,subset_type(cross_product(X6,X7)))
| ilf_type(X8,relation_type(X6,X7))
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type) )
& ( ~ ilf_type(X9,relation_type(X6,X7))
| ilf_type(X9,subset_type(cross_product(X6,X7)))
| ~ 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_17,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ilf_type(X1,member_type(X2))
| empty(X2)
| ~ member(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
fof(c_0_20,plain,
! [X22,X23,X24] :
( ( ~ subset(X22,X23)
| ~ ilf_type(X24,set_type)
| ~ member(X24,X22)
| member(X24,X23)
| ~ ilf_type(X23,set_type)
| ~ ilf_type(X22,set_type) )
& ( ilf_type(esk4_2(X22,X23),set_type)
| subset(X22,X23)
| ~ ilf_type(X23,set_type)
| ~ ilf_type(X22,set_type) )
& ( member(esk4_2(X22,X23),X22)
| subset(X22,X23)
| ~ ilf_type(X23,set_type)
| ~ ilf_type(X22,set_type) )
& ( ~ member(esk4_2(X22,X23),X23)
| subset(X22,X23)
| ~ ilf_type(X23,set_type)
| ~ ilf_type(X22,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)],[p5])])])])]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_3]) ).
cnf(c_0_22,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_15])]) ).
cnf(c_0_24,plain,
( ilf_type(X1,member_type(X2))
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_15])]),c_0_19]) ).
fof(c_0_25,plain,
! [X33,X34,X35] :
( ( ~ member(X33,power_set(X34))
| ~ ilf_type(X35,set_type)
| ~ member(X35,X33)
| member(X35,X34)
| ~ ilf_type(X34,set_type)
| ~ ilf_type(X33,set_type) )
& ( ilf_type(esk6_2(X33,X34),set_type)
| member(X33,power_set(X34))
| ~ ilf_type(X34,set_type)
| ~ ilf_type(X33,set_type) )
& ( member(esk6_2(X33,X34),X33)
| member(X33,power_set(X34))
| ~ ilf_type(X34,set_type)
| ~ ilf_type(X33,set_type) )
& ( ~ member(esk6_2(X33,X34),X34)
| member(X33,power_set(X34))
| ~ ilf_type(X34,set_type)
| ~ ilf_type(X33,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)],[p10])])])])]) ).
cnf(c_0_26,plain,
( member(X3,X2)
| ~ subset(X1,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_20]) ).
fof(c_0_27,negated_conjecture,
( ilf_type(esk12_0,set_type)
& ilf_type(esk13_0,set_type)
& ilf_type(esk14_0,set_type)
& subset(esk12_0,cross_product(esk13_0,esk14_0))
& ~ ilf_type(esk12_0,relation_type(esk13_0,esk14_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_28,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_15])]) ).
cnf(c_0_29,plain,
( ilf_type(X1,subset_type(X2))
| ~ member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( member(X1,power_set(X2))
| ~ member(esk6_2(X1,X2),X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_32,negated_conjecture,
subset(esk12_0,cross_product(esk13_0,esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ ilf_type(esk12_0,relation_type(esk13_0,esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ member(X1,power_set(cross_product(X2,X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( member(X1,power_set(X2))
| ~ member(esk6_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_15]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
( member(X1,cross_product(esk13_0,esk14_0))
| ~ member(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( member(esk6_2(X1,X2),X1)
| member(X1,power_set(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,negated_conjecture,
~ member(esk12_0,power_set(cross_product(esk13_0,esk14_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( member(X1,power_set(cross_product(esk13_0,esk14_0)))
| ~ member(esk6_2(X1,cross_product(esk13_0,esk14_0)),esk12_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( member(esk6_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_15]),c_0_15])]) ).
cnf(c_0_41,negated_conjecture,
~ member(esk6_2(esk12_0,cross_product(esk13_0,esk14_0)),esk12_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SET641+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n008.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 : Mon Oct 2 16:59:58 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.hZi2bIs5Pk/E---3.1_28042.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28119 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 189s (1) cores
% 0.17/0.45 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.17/0.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.45 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 28126 completed with status 0
% 0.17/0.45 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 189s (1) cores
% 0.17/0.45 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 19
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 45
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 45
% 0.17/0.45 # Processed clauses : 105
% 0.17/0.45 # ...of these trivial : 11
% 0.17/0.45 # ...subsumed : 5
% 0.17/0.45 # ...remaining for further processing : 89
% 0.17/0.45 # Other redundant clauses eliminated : 1
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 3
% 0.17/0.45 # Generated clauses : 57
% 0.17/0.45 # ...of the previous two non-redundant : 37
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 1
% 0.17/0.45 # Paramodulations : 56
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 1
% 0.17/0.45 # Total rewrite steps : 98
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 54
% 0.17/0.45 # Positive orientable unit clauses : 14
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 4
% 0.17/0.45 # Non-unit-clauses : 36
% 0.17/0.45 # Current number of unprocessed clauses: 8
% 0.17/0.45 # ...number of literals in the above : 19
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 34
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 313
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 297
% 0.17/0.45 # Non-unit clause-clause subsumptions : 2
% 0.17/0.45 # Unit Clause-clause subsumption calls : 47
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 5
% 0.17/0.45 # BW rewrite match successes : 3
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 4448
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.008 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.010 s
% 0.17/0.45 # Maximum resident set size: 1844 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.030 s
% 0.17/0.45 # System time : 0.008 s
% 0.17/0.45 # Total time : 0.038 s
% 0.17/0.45 # Maximum resident set size: 1700 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------