TSTP Solution File: SET640+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET640+3 : TPTP v8.1.2. Released v2.2.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:20:05 EDT 2023
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 194 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 238 ( 92 ~; 91 |; 20 &)
% ( 5 <=>; 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; 5 con; 0-2 aty)
% Number of variables : 85 ( 2 sgn; 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p13,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.RwNfvIoAeH/E---3.1_23446.p',p13) ).
fof(p12,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
file('/export/starexec/sandbox/tmp/tmp.RwNfvIoAeH/E---3.1_23446.p',p12) ).
fof(p19,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/tmp.RwNfvIoAeH/E---3.1_23446.p',p19) ).
fof(p8,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.RwNfvIoAeH/E---3.1_23446.p',p8) ).
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.RwNfvIoAeH/E---3.1_23446.p',p4) ).
fof(prove_relset_1_2,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X2,X3))
=> ( subset(X1,X4)
=> subset(X1,cross_product(X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RwNfvIoAeH/E---3.1_23446.p',prove_relset_1_2) ).
fof(p11,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.RwNfvIoAeH/E---3.1_23446.p',p11) ).
fof(p6,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.RwNfvIoAeH/E---3.1_23446.p',p6) ).
fof(c_0_8,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)],[p13]) ).
fof(c_0_9,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( ~ empty(power_set(X1))
& ilf_type(power_set(X1),set_type) ) ),
inference(fof_simplification,[status(thm)],[p12]) ).
fof(c_0_10,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_8])])])]) ).
fof(c_0_11,plain,
! [X20] : ilf_type(X20,set_type),
inference(variable_rename,[status(thm)],[p19]) ).
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)],[p8])])])]) ).
fof(c_0_13,plain,
! [X46] :
( ( ~ empty(power_set(X46))
| ~ ilf_type(X46,set_type) )
& ( ilf_type(power_set(X46),set_type)
| ~ ilf_type(X46,set_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X21,X22,X23,X24] :
( ( ~ ilf_type(X23,subset_type(cross_product(X21,X22)))
| ilf_type(X23,relation_type(X21,X22))
| ~ ilf_type(X22,set_type)
| ~ ilf_type(X21,set_type) )
& ( ~ ilf_type(X24,relation_type(X21,X22))
| ilf_type(X24,subset_type(cross_product(X21,X22)))
| ~ ilf_type(X22,set_type)
| ~ ilf_type(X21,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_15,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X2,X3))
=> ( subset(X1,X4)
=> subset(X1,cross_product(X2,X3)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_2]) ).
cnf(c_0_16,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_10]) ).
cnf(c_0_17,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,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_19,plain,
( ~ empty(power_set(X1))
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,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_14]) ).
fof(c_0_21,negated_conjecture,
( ilf_type(esk1_0,set_type)
& ilf_type(esk2_0,set_type)
& ilf_type(esk3_0,set_type)
& ilf_type(esk4_0,relation_type(esk2_0,esk3_0))
& subset(esk1_0,esk4_0)
& ~ subset(esk1_0,cross_product(esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_22,plain,
! [X42,X43,X44] :
( ( ~ member(X42,power_set(X43))
| ~ ilf_type(X44,set_type)
| ~ member(X44,X42)
| member(X44,X43)
| ~ ilf_type(X43,set_type)
| ~ ilf_type(X42,set_type) )
& ( ilf_type(esk10_2(X42,X43),set_type)
| member(X42,power_set(X43))
| ~ ilf_type(X43,set_type)
| ~ ilf_type(X42,set_type) )
& ( member(esk10_2(X42,X43),X42)
| member(X42,power_set(X43))
| ~ ilf_type(X43,set_type)
| ~ ilf_type(X42,set_type) )
& ( ~ member(esk10_2(X42,X43),X43)
| member(X42,power_set(X43))
| ~ ilf_type(X43,set_type)
| ~ 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)],[p11])])])])]) ).
cnf(c_0_23,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_16,c_0_17]),c_0_17])]) ).
cnf(c_0_24,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_18,c_0_17]),c_0_17])]) ).
cnf(c_0_25,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_17])]) ).
cnf(c_0_26,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_20,c_0_17]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
ilf_type(esk4_0,relation_type(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X13,X14,X15] :
( ( ~ subset(X13,X14)
| ~ ilf_type(X15,set_type)
| ~ member(X15,X13)
| member(X15,X14)
| ~ ilf_type(X14,set_type)
| ~ ilf_type(X13,set_type) )
& ( ilf_type(esk5_2(X13,X14),set_type)
| subset(X13,X14)
| ~ ilf_type(X14,set_type)
| ~ ilf_type(X13,set_type) )
& ( member(esk5_2(X13,X14),X13)
| subset(X13,X14)
| ~ ilf_type(X14,set_type)
| ~ ilf_type(X13,set_type) )
& ( ~ member(esk5_2(X13,X14),X14)
| subset(X13,X14)
| ~ ilf_type(X14,set_type)
| ~ ilf_type(X13,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)],[p6])])])])]) ).
cnf(c_0_29,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_22]) ).
cnf(c_0_30,plain,
( member(X1,power_set(X2))
| ~ ilf_type(X1,subset_type(X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ilf_type(esk4_0,subset_type(cross_product(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,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_28]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| ~ member(esk5_2(X1,X2),X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,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_29,c_0_17]),c_0_17]),c_0_17])]) ).
cnf(c_0_35,negated_conjecture,
member(esk4_0,power_set(cross_product(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_17]),c_0_17]),c_0_17])]) ).
cnf(c_0_37,negated_conjecture,
subset(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_38,plain,
( member(esk5_2(X1,X2),X1)
| subset(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,negated_conjecture,
~ subset(esk1_0,cross_product(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ member(esk5_2(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_17]),c_0_17])]) ).
cnf(c_0_41,negated_conjecture,
( member(X1,cross_product(esk2_0,esk3_0))
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( member(esk5_2(X1,X2),X1)
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_17]),c_0_17])]) ).
cnf(c_0_44,negated_conjecture,
~ member(esk5_2(esk1_0,cross_product(esk2_0,esk3_0)),cross_product(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( member(X1,cross_product(esk2_0,esk3_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
member(esk5_2(esk1_0,cross_product(esk2_0,esk3_0)),esk1_0),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET640+3 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n005.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 16:37:01 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.RwNfvIoAeH/E---3.1_23446.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 23525 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.16/0.43 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 23528 completed with status 0
% 0.16/0.43 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 20
% 0.16/0.43 # Removed by relevancy pruning/SinE : 2
% 0.16/0.43 # Initial clauses : 40
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 40
% 0.16/0.43 # Processed clauses : 94
% 0.16/0.43 # ...of these trivial : 8
% 0.16/0.43 # ...subsumed : 5
% 0.16/0.43 # ...remaining for further processing : 81
% 0.16/0.43 # Other redundant clauses eliminated : 1
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 3
% 0.16/0.43 # Generated clauses : 60
% 0.16/0.43 # ...of the previous two non-redundant : 49
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 1
% 0.16/0.43 # Paramodulations : 59
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 1
% 0.16/0.43 # Total rewrite steps : 73
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 49
% 0.16/0.43 # Positive orientable unit clauses : 15
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 4
% 0.16/0.43 # Non-unit-clauses : 30
% 0.16/0.43 # Current number of unprocessed clauses: 23
% 0.16/0.43 # ...number of literals in the above : 56
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 32
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 234
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 212
% 0.16/0.43 # Non-unit clause-clause subsumptions : 3
% 0.16/0.43 # Unit Clause-clause subsumption calls : 63
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 8
% 0.16/0.43 # BW rewrite match successes : 3
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 3917
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.009 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.010 s
% 0.16/0.43 # Maximum resident set size: 1840 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.010 s
% 0.16/0.43 # System time : 0.003 s
% 0.16/0.43 # Total time : 0.013 s
% 0.16/0.43 # Maximum resident set size: 1700 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------