%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET936+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:15:48 PM UTC 2026
% Result : Theorem 2.14s 0.76s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 23 unt; 0 def)
% Number of atoms : 133 ( 29 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 139 ( 60 ~; 62 |; 11 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 114 ( 13 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(t83_zfmisc_1,conjecture,
! [X1,X2] : powerset(set_intersection2(X1,X2)) = set_intersection2(powerset(X1),powerset(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_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(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X3)
& subset(X1,X2) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(c_0_8,plain,
! [X34,X35,X36] :
( subset(X34,X36)
| ~ subset(X35,X36)
| ~ subset(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_9,plain,
! [X29,X30] : subset(set_intersection2(X29,X30),X29),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_10,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( X14 = powerset(X13)
| subset(esk1_2(X13,X14),X13)
| in(esk1_2(X13,X14),X14) )
& ( X14 = powerset(X13)
| ~ subset(esk1_2(X13,X14),X13)
| ~ in(esk1_2(X13,X14),X14) )
& ( X10 != powerset(X9)
| in(X12,X10)
| ~ subset(X12,X9) )
& ( X10 != powerset(X9)
| subset(X11,X9)
| ~ in(X11,X10) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] : powerset(set_intersection2(X1,X2)) = set_intersection2(powerset(X1),powerset(X2)),
inference(assume_negation,[status(cth)],[t83_zfmisc_1]) ).
cnf(c_0_12,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X2 != powerset(X3)
| ~ in(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_16,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( X23 = set_intersection2(X21,X22)
| in(esk2_3(X21,X22,X23),X23)
| in(esk2_3(X21,X22,X23),X22) )
& ( X23 = set_intersection2(X21,X22)
| in(esk2_3(X21,X22,X23),X23)
| in(esk2_3(X21,X22,X23),X21) )
& ( X23 = set_intersection2(X21,X22)
| ~ in(esk2_3(X21,X22,X23),X22)
| ~ in(esk2_3(X21,X22,X23),X21)
| ~ in(esk2_3(X21,X22,X23),X23) )
& ( X18 != set_intersection2(X16,X17)
| in(X20,X18)
| ~ in(X20,X17)
| ~ in(X20,X16) )
& ( X18 != set_intersection2(X16,X17)
| ~ in(X19,X18)
| in(X19,X17) )
& ( X18 != set_intersection2(X16,X17)
| ~ in(X19,X18)
| in(X19,X16) ) ),
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_xboole_0])])])])])])]) ).
cnf(c_0_17,plain,
( X3 != powerset(X2)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ subset(X1,set_intersection2(X2,X3))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ in(X1,powerset(X2))
| subset(X1,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ subset(esk1_2(X1,X2),X1)
| ~ in(esk1_2(X1,X2),X2)
| X2 = powerset(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ subset(X1,X2)
| in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ in(X1,powerset(set_intersection2(X2,X3)))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0)))
| ~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_27,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ in(X1,powerset(set_intersection2(X2,X3)))
| in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( X2 = powerset(X1)
| subset(esk1_2(X1,X2),X1)
| in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk6_0))
| ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk7_0))
| ~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ in(X1,powerset(set_intersection2(X3,X2)))
| in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0)))
| subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(set_intersection2(esk6_0,esk7_0))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_28]),c_0_32]) ).
cnf(c_0_36,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,plain,
( ~ in(X3,powerset(X2))
| ~ subset(X1,X3)
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_38,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_35]) ).
cnf(c_0_40,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( ~ in(X1,powerset(X3))
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_42,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk7_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_43,plain,
! [X25] : set_intersection2(X25,X25) = X25,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_44,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk6_0)),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
fof(c_0_45,plain,
! [X31,X32,X33] :
( subset(X31,set_intersection2(X32,X33))
| ~ subset(X31,X33)
| ~ subset(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
cnf(c_0_46,negated_conjecture,
subset(set_intersection2(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),X1),esk7_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
subset(set_intersection2(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),X1),esk6_0),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_39])]) ).
cnf(c_0_50,plain,
( ~ subset(X1,X3)
| ~ subset(X1,X2)
| subset(X1,set_intersection2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),esk7_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),esk6_0),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET936+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 05:49:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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/benchmark/theBenchmark.p
% 2.14/0.76 % Version: 3.5.1
% 2.14/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.14/0.76 % Starting new_bool_3 with 300s (1) cores
% 2.14/0.76 % Starting new_bool_1 with 300s (1) cores
% 2.14/0.76 % Starting sh5l with 300s (1) cores
% 2.14/0.76 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1688218 completed with status 0
% 2.14/0.76 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.14/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.14/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.14/0.76 % No SInE strategy applied
% 2.14/0.76 % Search class: FGHSM-FFMF32-SFFFFFNN
% 2.14/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.14/0.76 % Starting SubtermCWHack with 136s (1) cores
% 2.14/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.14/0.76 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 2.14/0.76 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.14/0.76 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 2.14/0.76 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 1688229 completed with status 0
% 2.14/0.76 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 2.14/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.14/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.14/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.14/0.76 % No SInE strategy applied
% 2.14/0.76 % Search class: FGHSM-FFMF32-SFFFFFNN
% 2.14/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.14/0.76 % Starting SubtermCWHack with 136s (1) cores
% 2.14/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.14/0.76 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 2.14/0.76 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.14/0.76 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 2.14/0.76 % Preprocessing time : 0.001 s
% 2.14/0.76 % Presaturation interreduction done
% 2.14/0.76
% 2.14/0.76 % Proof found!
% 2.14/0.76 % SZS status Theorem
% 2.14/0.76 % SZS output start CNFRefutation
% See solution above
% 2.14/0.76 % Parsed axioms : 13
% 2.14/0.76 % Removed by relevancy pruning/SinE : 0
% 2.14/0.76 % Initial clauses : 22
% 2.14/0.76 % Removed in clause preprocessing : 0
% 2.14/0.76 % Initial clauses in saturation : 22
% 2.14/0.76 % Processed clauses : 861
% 2.14/0.76 % ...of these trivial : 51
% 2.14/0.76 % ...subsumed : 469
% 2.14/0.76 % ...remaining for further processing : 340
% 2.14/0.76 % Other redundant clauses eliminated : 107
% 2.14/0.76 % Clauses deleted for lack of memory : 0
% 2.14/0.76 % Backward-subsumed : 7
% 2.14/0.76 % Backward-rewritten : 4
% 2.14/0.76 % Generated clauses : 16450
% 2.14/0.76 % ...of the previous two non-redundant : 15930
% 2.14/0.76 % ...aggressively subsumed : 0
% 2.14/0.76 % Contextual simplify-reflections : 6
% 2.14/0.76 % Paramodulations : 16327
% 2.14/0.76 % Factorizations : 16
% 2.14/0.76 % NegExts : 0
% 2.14/0.76 % Equation resolutions : 107
% 2.14/0.76 % Disequality decompositions : 0
% 2.14/0.76 % Total rewrite steps : 1356
% 2.14/0.76 % ...of those cached : 1253
% 2.14/0.76 % Propositional unsat checks : 0
% 2.14/0.76 % Propositional check models : 0
% 2.14/0.76 % Propositional check unsatisfiable : 0
% 2.14/0.76 % Propositional clauses : 0
% 2.14/0.76 % Propositional clauses after purity: 0
% 2.14/0.76 % Propositional unsat core size : 0
% 2.14/0.76 % Propositional preprocessing time : 0.000
% 2.14/0.76 % Propositional encoding time : 0.000
% 2.14/0.76 % Propositional solver time : 0.000
% 2.14/0.76 % Success case prop preproc time : 0.000
% 2.14/0.76 % Success case prop encoding time : 0.000
% 2.14/0.76 % Success case prop solver time : 0.000
% 2.14/0.76 % Current number of processed clauses : 302
% 2.14/0.76 % Positive orientable unit clauses : 33
% 2.14/0.76 % Positive unorientable unit clauses: 1
% 2.14/0.76 % Negative unit clauses : 26
% 2.14/0.76 % Non-unit-clauses : 242
% 2.14/0.76 % Current number of unprocessed clauses: 15037
% 2.14/0.76 % ...number of literals in the above : 61190
% 2.14/0.76 % Current number of archived formulas : 0
% 2.14/0.76 % Current number of archived clauses : 33
% 2.14/0.76 % Clause-clause subsumption calls (NU) : 9824
% 2.14/0.76 % Rec. Clause-clause subsumption calls : 6959
% 2.14/0.76 % Non-unit clause-clause subsumptions : 321
% 2.14/0.76 % Unit Clause-clause subsumption calls : 219
% 2.14/0.76 % Rewrite failures with RHS unbound : 0
% 2.14/0.76 % BW rewrite match attempts : 51
% 2.14/0.76 % BW rewrite match successes : 14
% 2.14/0.76 % Condensation attempts : 0
% 2.14/0.76 % Condensation successes : 0
% 2.14/0.76 % Termbank termtop insertions : 283209
% 2.14/0.77 % Search garbage collected termcells : 404
% 2.14/0.77
% 2.14/0.77 % -------------------------------------------------
% 2.14/0.77 % User time : 0.264 s
% 2.14/0.77 % System time : 0.012 s
% 2.14/0.77 % Total time : 0.276 s
% 2.14/0.77 % Maximum resident set size: 3588 pages
% 2.14/0.77
% 2.14/0.77 % -------------------------------------------------
% 2.14/0.77 % User time : 1.413 s
% 2.14/0.77 % System time : 0.079 s
% 2.14/0.77 % Total time : 1.492 s
% 2.14/0.77 % Maximum resident set size: 4608 pages
% 2.14/0.77 % E exiting
%------------------------------------------------------------------------------