TSTP Solution File: SET645+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET645+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:55:08 EDT 2024
% Result : Theorem 0.18s 0.49s
% 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/benchmark/theBenchmark.p',p4) ).
fof(p21,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',p1) ).
fof(c_0_8,plain,
! [X25,X26,X27,X28] :
( ( ~ ilf_type(X27,subset_type(cross_product(X25,X26)))
| ilf_type(X27,relation_type(X25,X26))
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type) )
& ( ~ ilf_type(X28,relation_type(X25,X26))
| ilf_type(X28,subset_type(cross_product(X25,X26)))
| ~ ilf_type(X26,set_type)
| ~ ilf_type(X25,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p4])])])])]) ).
fof(c_0_9,plain,
! [X24] : ilf_type(X24,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,
! [X37,X38] :
( ( ~ ilf_type(X38,subset_type(X37))
| ilf_type(X38,member_type(power_set(X37)))
| ~ ilf_type(X38,set_type)
| ~ ilf_type(X37,set_type) )
& ( ~ ilf_type(X38,member_type(power_set(X37)))
| ilf_type(X38,subset_type(X37))
| ~ ilf_type(X38,set_type)
| ~ ilf_type(X37,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk1_0,set_type)
& ilf_type(esk2_0,set_type)
& ilf_type(esk3_0,set_type)
& ilf_type(esk4_0,set_type)
& ilf_type(esk5_0,relation_type(esk1_0,esk2_0))
& member(ordered_pair(esk3_0,esk4_0),esk5_0)
& ( ~ member(esk3_0,esk1_0)
| ~ member(esk4_0,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[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,
! [X53,X54,X55] :
( ( ~ member(X53,power_set(X54))
| ~ ilf_type(X55,set_type)
| ~ member(X55,X53)
| member(X55,X54)
| ~ ilf_type(X54,set_type)
| ~ ilf_type(X53,set_type) )
& ( ilf_type(esk14_2(X53,X54),set_type)
| member(X53,power_set(X54))
| ~ ilf_type(X54,set_type)
| ~ ilf_type(X53,set_type) )
& ( member(esk14_2(X53,X54),X53)
| member(X53,power_set(X54))
| ~ ilf_type(X54,set_type)
| ~ ilf_type(X53,set_type) )
& ( ~ member(esk14_2(X53,X54),X54)
| member(X53,power_set(X54))
| ~ ilf_type(X54,set_type)
| ~ ilf_type(X53,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X49,X50] :
( ( ~ ilf_type(X49,member_type(X50))
| member(X49,X50)
| empty(X50)
| ~ ilf_type(X50,set_type)
| ~ ilf_type(X49,set_type) )
& ( ~ member(X49,X50)
| ilf_type(X49,member_type(X50))
| empty(X50)
| ~ ilf_type(X50,set_type)
| ~ ilf_type(X49,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk5_0,relation_type(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X57] :
( ( ~ empty(power_set(X57))
| ~ ilf_type(X57,set_type) )
& ( ilf_type(power_set(X57),set_type)
| ~ ilf_type(X57,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk5_0,subset_type(cross_product(esk1_0,esk2_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,
! [X18,X19,X20,X21] :
( ( member(X18,X20)
| ~ member(ordered_pair(X18,X19),cross_product(X20,X21))
| ~ ilf_type(X21,set_type)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( member(X19,X21)
| ~ member(ordered_pair(X18,X19),cross_product(X20,X21))
| ~ ilf_type(X21,set_type)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) )
& ( ~ member(X18,X20)
| ~ member(X19,X21)
| member(ordered_pair(X18,X19),cross_product(X20,X21))
| ~ ilf_type(X21,set_type)
| ~ ilf_type(X20,set_type)
| ~ ilf_type(X19,set_type)
| ~ ilf_type(X18,set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk3_0,esk4_0),esk5_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(esk5_0,member_type(power_set(cross_product(esk1_0,esk2_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(esk3_0,esk4_0),X1)
| ~ member(esk5_0,power_set(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
member(esk5_0,power_set(cross_product(esk1_0,esk2_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(esk3_0,esk4_0),cross_product(esk1_0,esk2_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(esk3_0,esk1_0)
| ~ member(esk4_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
member(esk3_0,esk1_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(esk4_0,esk2_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.07/0.12 % Problem : SET645+3 : TPTP v8.2.0. Released v2.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n017.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon May 20 11:16:37 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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/benchmark/theBenchmark.p
% 0.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_3 with pid 22494 completed with status 0
% 0.18/0.49 # Result found by new_bool_3
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.18/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 22498 completed with status 0
% 0.18/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 22
% 0.18/0.49 # Removed by relevancy pruning/SinE : 4
% 0.18/0.49 # Initial clauses : 44
% 0.18/0.49 # Removed in clause preprocessing : 2
% 0.18/0.49 # Initial clauses in saturation : 42
% 0.18/0.49 # Processed clauses : 133
% 0.18/0.49 # ...of these trivial : 9
% 0.18/0.49 # ...subsumed : 21
% 0.18/0.49 # ...remaining for further processing : 102
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 5
% 0.18/0.49 # Generated clauses : 125
% 0.18/0.49 # ...of the previous two non-redundant : 102
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 1
% 0.18/0.49 # Paramodulations : 123
% 0.18/0.49 # Factorizations : 2
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 101
% 0.18/0.49 # ...of those cached : 65
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 68
% 0.18/0.49 # Positive orientable unit clauses : 28
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 5
% 0.18/0.49 # Non-unit-clauses : 35
% 0.18/0.49 # Current number of unprocessed clauses: 40
% 0.18/0.49 # ...number of literals in the above : 94
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 34
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 175
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 142
% 0.18/0.49 # Non-unit clause-clause subsumptions : 10
% 0.18/0.49 # Unit Clause-clause subsumption calls : 40
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 22
% 0.18/0.49 # BW rewrite match successes : 5
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 5488
% 0.18/0.49 # Search garbage collected termcells : 1016
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.010 s
% 0.18/0.49 # System time : 0.004 s
% 0.18/0.49 # Total time : 0.014 s
% 0.18/0.49 # Maximum resident set size: 1840 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.012 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.017 s
% 0.18/0.49 # Maximum resident set size: 1716 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------