TSTP Solution File: SEU131+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU131+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 03:31:24 EDT 2024
% Result : Theorem 0.90s 0.62s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 185 ( 36 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 204 ( 85 ~; 73 |; 32 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 170 ( 19 sgn 80 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(t4_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(l32_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_12,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_13,plain,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ( in(X44,X41)
| ~ in(X44,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(X44,X42)
| ~ in(X44,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(X45,X41)
| in(X45,X42)
| in(X45,X43)
| X43 != set_difference(X41,X42) )
& ( ~ in(esk5_3(X46,X47,X48),X48)
| ~ in(esk5_3(X46,X47,X48),X46)
| in(esk5_3(X46,X47,X48),X47)
| X48 = set_difference(X46,X47) )
& ( in(esk5_3(X46,X47,X48),X46)
| in(esk5_3(X46,X47,X48),X48)
| X48 = set_difference(X46,X47) )
& ( ~ in(esk5_3(X46,X47,X48),X47)
| in(esk5_3(X46,X47,X48),X48)
| X48 = set_difference(X46,X47) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
fof(c_0_14,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
fof(c_0_15,lemma,
! [X95,X96,X98,X99,X100] :
( ( disjoint(X95,X96)
| in(esk12_2(X95,X96),set_intersection2(X95,X96)) )
& ( ~ in(X100,set_intersection2(X98,X99))
| ~ disjoint(X98,X99) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
fof(c_0_16,plain,
! [X9,X10] : set_intersection2(X9,X10) = set_intersection2(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_17,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,lemma,
! [X87,X88,X90,X91,X92] :
( ( in(esk11_2(X87,X88),X87)
| disjoint(X87,X88) )
& ( in(esk11_2(X87,X88),X88)
| disjoint(X87,X88) )
& ( ~ in(X92,X90)
| ~ in(X92,X91)
| ~ disjoint(X90,X91) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])])]) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X26,X27,X28,X29,X30] :
( ( ~ subset(X26,X27)
| ~ in(X28,X26)
| in(X28,X27) )
& ( in(esk3_2(X29,X30),X29)
| subset(X29,X30) )
& ( ~ in(esk3_2(X29,X30),X30)
| subset(X29,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
cnf(c_0_21,lemma,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,lemma,
! [X79,X80] :
( ~ subset(X79,X80)
| set_intersection2(X79,X80) = X79 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).
cnf(c_0_24,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_25,lemma,
( in(esk11_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,lemma,
! [X73,X74,X75] :
( ~ subset(X73,X74)
| ~ subset(X74,X75)
| subset(X73,X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_27,lemma,
! [X67,X68] : subset(set_intersection2(X67,X68),X67),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_28,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,lemma,
( disjoint(X1,set_difference(X2,X3))
| ~ in(esk11_2(X1,set_difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,lemma,
( in(esk11_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_37,plain,
( subset(set_difference(X1,X2),X3)
| in(esk3_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_38,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_39,lemma,
( ~ disjoint(X1,X2)
| ~ subset(X2,X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,lemma,
disjoint(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,lemma,
( subset(X1,X2)
| ~ subset(X1,set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_43,plain,
! [X13,X14,X15] :
( ( X13 != empty_set
| ~ in(X14,X13) )
& ( in(esk1_1(X15),X15)
| X15 = empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])])])]) ).
cnf(c_0_44,lemma,
( ~ subset(set_difference(X1,X2),X2)
| ~ in(X3,set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,lemma,
subset(set_difference(set_intersection2(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_47,plain,
! [X82,X83] :
( ( ~ in(esk10_2(X82,X83),X82)
| ~ in(esk10_2(X82,X83),X83)
| X82 = X83 )
& ( in(esk10_2(X82,X83),X82)
| in(esk10_2(X82,X83),X83)
| X82 = X83 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])])]) ).
fof(c_0_48,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[l32_xboole_1]) ).
cnf(c_0_49,lemma,
~ in(X1,set_difference(set_intersection2(X2,X3),X2)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,lemma,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_51,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
( in(esk10_2(X1,X2),X1)
| in(esk10_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_53,negated_conjecture,
( ( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) )
& ( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])])]) ).
cnf(c_0_54,lemma,
( ~ subset(X1,X2)
| ~ in(X3,set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
( empty_set = X1
| in(esk10_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_57,negated_conjecture,
( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
~ subset(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),set_difference(X1,X3))
| in(esk3_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_59,c_0_29]) ).
cnf(c_0_63,negated_conjecture,
set_difference(esk6_0,esk7_0) = empty_set,
inference(sr,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( subset(esk6_0,X1)
| in(esk3_2(esk6_0,X1),esk7_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_51]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_64]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU131+2 : TPTP v8.2.0. Released v3.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sun May 19 15:45:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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/benchmark/theBenchmark.p
% 0.90/0.62 # Version: 3.1.0
% 0.90/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.90/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.90/0.62 # Starting sh5l with 300s (1) cores
% 0.90/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8467 completed with status 0
% 0.90/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.90/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.62 # No SInE strategy applied
% 0.90/0.62 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.90/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.90/0.62 # Starting new_bool_3 with 136s (1) cores
% 0.90/0.62 # Starting new_bool_1 with 136s (1) cores
% 0.90/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8473 completed with status 0
% 0.90/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.90/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.62 # No SInE strategy applied
% 0.90/0.62 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.90/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.90/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.62 # Preprocessing time : 0.002 s
% 0.90/0.62 # Presaturation interreduction done
% 0.90/0.62
% 0.90/0.62 # Proof found!
% 0.90/0.62 # SZS status Theorem
% 0.90/0.62 # SZS output start CNFRefutation
% See solution above
% 0.90/0.62 # Parsed axioms : 44
% 0.90/0.62 # Removed by relevancy pruning/SinE : 0
% 0.90/0.62 # Initial clauses : 70
% 0.90/0.62 # Removed in clause preprocessing : 4
% 0.90/0.62 # Initial clauses in saturation : 66
% 0.90/0.62 # Processed clauses : 1970
% 0.90/0.62 # ...of these trivial : 13
% 0.90/0.62 # ...subsumed : 1503
% 0.90/0.62 # ...remaining for further processing : 454
% 0.90/0.62 # Other redundant clauses eliminated : 29
% 0.90/0.62 # Clauses deleted for lack of memory : 0
% 0.90/0.62 # Backward-subsumed : 6
% 0.90/0.62 # Backward-rewritten : 3
% 0.90/0.62 # Generated clauses : 7387
% 0.90/0.62 # ...of the previous two non-redundant : 6663
% 0.90/0.62 # ...aggressively subsumed : 0
% 0.90/0.62 # Contextual simplify-reflections : 2
% 0.90/0.62 # Paramodulations : 7278
% 0.90/0.62 # Factorizations : 78
% 0.90/0.62 # NegExts : 0
% 0.90/0.62 # Equation resolutions : 29
% 0.90/0.62 # Disequality decompositions : 0
% 0.90/0.62 # Total rewrite steps : 1351
% 0.90/0.62 # ...of those cached : 1233
% 0.90/0.62 # Propositional unsat checks : 0
% 0.90/0.62 # Propositional check models : 0
% 0.90/0.62 # Propositional check unsatisfiable : 0
% 0.90/0.62 # Propositional clauses : 0
% 0.90/0.62 # Propositional clauses after purity: 0
% 0.90/0.62 # Propositional unsat core size : 0
% 0.90/0.62 # Propositional preprocessing time : 0.000
% 0.90/0.62 # Propositional encoding time : 0.000
% 0.90/0.62 # Propositional solver time : 0.000
% 0.90/0.62 # Success case prop preproc time : 0.000
% 0.90/0.62 # Success case prop encoding time : 0.000
% 0.90/0.62 # Success case prop solver time : 0.000
% 0.90/0.62 # Current number of processed clauses : 367
% 0.90/0.62 # Positive orientable unit clauses : 31
% 0.90/0.62 # Positive unorientable unit clauses: 2
% 0.90/0.62 # Negative unit clauses : 6
% 0.90/0.62 # Non-unit-clauses : 328
% 0.90/0.62 # Current number of unprocessed clauses: 4784
% 0.90/0.62 # ...number of literals in the above : 15529
% 0.90/0.62 # Current number of archived formulas : 0
% 0.90/0.62 # Current number of archived clauses : 75
% 0.90/0.62 # Clause-clause subsumption calls (NU) : 31283
% 0.90/0.62 # Rec. Clause-clause subsumption calls : 20625
% 0.90/0.62 # Non-unit clause-clause subsumptions : 1201
% 0.90/0.62 # Unit Clause-clause subsumption calls : 878
% 0.90/0.62 # Rewrite failures with RHS unbound : 0
% 0.90/0.62 # BW rewrite match attempts : 62
% 0.90/0.62 # BW rewrite match successes : 33
% 0.90/0.62 # Condensation attempts : 0
% 0.90/0.62 # Condensation successes : 0
% 0.90/0.62 # Termbank termtop insertions : 78550
% 0.90/0.62 # Search garbage collected termcells : 1027
% 0.90/0.62
% 0.90/0.62 # -------------------------------------------------
% 0.90/0.62 # User time : 0.083 s
% 0.90/0.62 # System time : 0.004 s
% 0.90/0.62 # Total time : 0.087 s
% 0.90/0.62 # Maximum resident set size: 1900 pages
% 0.90/0.62
% 0.90/0.62 # -------------------------------------------------
% 0.90/0.62 # User time : 0.441 s
% 0.90/0.62 # System time : 0.018 s
% 0.90/0.62 # Total time : 0.458 s
% 0.90/0.62 # Maximum resident set size: 1720 pages
% 0.90/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------