%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:23:56 PM UTC 2026
% Result : Theorem 2.18s 0.85s
% Output : CNFRefutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 8 unt; 0 def)
% Number of atoms : 197 ( 51 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 224 ( 89 ~; 95 |; 27 &)
% ( 11 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 151 ( 10 sgn 67 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t83_xboole_1,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_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_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(t4_xboole_0,axiom,
! [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(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(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t83_xboole_1]) ).
fof(c_0_10,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_11,plain,
! [X41,X42] :
( disjoint(X42,X41)
| ~ disjoint(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])])]) ).
fof(c_0_12,negated_conjecture,
( ( set_difference(esk7_0,esk8_0) = esk7_0
| disjoint(esk7_0,esk8_0) )
& ( set_difference(esk7_0,esk8_0) != esk7_0
| ~ disjoint(esk7_0,esk8_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X33)
| ~ in(esk3_3(X31,X32,X33),X32) )
& ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X33)
| in(esk3_3(X31,X32,X33),X31) )
& ( X33 = set_difference(X31,X32)
| in(esk3_3(X31,X32,X33),X32)
| ~ in(esk3_3(X31,X32,X33),X31)
| ~ in(esk3_3(X31,X32,X33),X33) )
& ( X28 != set_difference(X26,X27)
| in(X30,X28)
| in(X30,X27)
| ~ in(X30,X26) )
& ( X28 != set_difference(X26,X27)
| ~ in(X29,X28)
| ~ in(X29,X27) )
& ( X28 != set_difference(X26,X27)
| ~ in(X29,X28)
| in(X29,X26) ) ),
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_10])])])])])])]) ).
fof(c_0_14,plain,
! [X35,X36] :
( ( disjoint(X35,X36)
| set_intersection2(X35,X36) != empty_set )
& ( set_intersection2(X35,X36) = empty_set
| ~ disjoint(X35,X36) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_15,plain,
( ~ disjoint(X1,X2)
| disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| disjoint(esk7_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_18,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X23) )
& ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X22) )
& ( X24 = set_intersection2(X22,X23)
| ~ in(esk2_3(X22,X23,X24),X23)
| ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X24) )
& ( X19 != set_intersection2(X17,X18)
| in(X21,X19)
| ~ in(X21,X18)
| ~ in(X21,X17) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X18) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X17) ) ),
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])])])])])])]) ).
fof(c_0_19,plain,
! [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]) ).
cnf(c_0_20,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( disjoint(esk8_0,esk7_0)
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X46,X47,X49,X50,X51] :
( ( ~ disjoint(X49,X50)
| ~ in(X51,set_intersection2(X49,X50)) )
& ( in(esk6_2(X46,X47),set_intersection2(X46,X47))
| disjoint(X46,X47) ) ),
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_19])])])])])]) ).
cnf(c_0_26,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( set_intersection2(esk7_0,esk8_0) = empty_set
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( in(esk6_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( ~ disjoint(X2,X3)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,plain,
! [X11,X12,X13,X14,X15] :
( ( subset(X14,X15)
| ~ in(esk1_2(X14,X15),X15) )
& ( subset(X14,X15)
| in(esk1_2(X14,X15),X14) )
& ( in(X13,X12)
| ~ in(X13,X11)
| ~ subset(X11,X12) ) ),
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_36,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(X1,esk7_0)
| set_intersection2(esk7_0,esk8_0) = empty_set ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( in(esk6_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( set_difference(esk7_0,esk8_0) != esk7_0
| ~ disjoint(esk7_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,plain,
( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(esk6_2(esk7_0,X1),esk8_0)
| disjoint(esk7_0,X1)
| set_intersection2(esk7_0,esk8_0) = empty_set ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( in(esk6_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_46,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,negated_conjecture,
( ~ in(X1,esk8_0)
| ~ in(X1,esk7_0)
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(spm,[status(thm)],[c_0_39,c_0_22]) ).
cnf(c_0_48,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
( in(esk1_2(X1,X2),X3)
| in(esk1_2(X1,X2),set_difference(X1,X3))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( set_intersection2(esk7_0,esk8_0) != empty_set
| set_difference(esk7_0,esk8_0) != esk7_0 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
set_intersection2(esk7_0,esk8_0) = empty_set,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_21]) ).
cnf(c_0_52,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_46]) ).
fof(c_0_53,plain,
! [X9,X10] :
( ( X9 = X10
| ~ subset(X10,X9)
| ~ subset(X9,X10) )
& ( X9 != X10
| subset(X10,X9) )
& ( X9 != X10
| subset(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ in(esk1_2(esk7_0,X1),esk8_0)
| subset(esk7_0,X1)
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(spm,[status(thm)],[c_0_47,c_0_41]) ).
cnf(c_0_55,plain,
( in(esk1_2(X1,set_difference(X1,X2)),X2)
| subset(X1,set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
set_difference(esk7_0,esk8_0) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_57,plain,
( in(esk1_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_58,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,negated_conjecture,
subset(esk7_0,set_difference(esk7_0,esk8_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_48,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.41 % Computer : n006.cluster.edu
% 0.17/0.41 % Model : x86_64 x86_64
% 0.17/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.41 % Memory : 8046.5625MB
% 0.17/0.41 % OS : Linux 6.8.0-71-generic
% 0.17/0.41 % CPULimit : 300
% 0.17/0.41 % WCLimit : 300
% 0.17/0.41 % DateTime : Mon Sep 21 05:52:27 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.18/0.85 % Version: 3.5.1
% 2.18/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.18/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.18/0.85 % Starting new_bool_3 with 300s (1) cores
% 2.18/0.85 % Starting new_bool_1 with 300s (1) cores
% 2.18/0.85 % Starting sh5l with 300s (1) cores
% 2.18/0.85 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2133846 completed with status 0
% 2.18/0.85 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.18/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.18/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.18/0.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.18/0.85 % No SInE strategy applied
% 2.18/0.85 % Search class: FGHSM-FFMS32-SFFFFFNN
% 2.18/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.18/0.85 % Starting SubtermCWHack with 136s (1) cores
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.18/0.85 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.18/0.85 % Starting new_bool_3 with 136s (1) cores
% 2.18/0.85 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2133853 completed with status 0
% 2.18/0.85 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.18/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.18/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.18/0.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.18/0.85 % No SInE strategy applied
% 2.18/0.85 % Search class: FGHSM-FFMS32-SFFFFFNN
% 2.18/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.18/0.85 % Starting SubtermCWHack with 136s (1) cores
% 2.18/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.18/0.85 % Preprocessing time : 0.002 s
% 2.18/0.85 % Presaturation interreduction done
% 2.18/0.85
% 2.18/0.85 % Proof found!
% 2.18/0.85 % SZS status Theorem
% 2.18/0.85 % SZS output start CNFRefutation
% See solution above
% 2.18/0.85 % Parsed axioms : 24
% 2.18/0.85 % Removed by relevancy pruning/SinE : 0
% 2.18/0.85 % Initial clauses : 41
% 2.18/0.85 % Removed in clause preprocessing : 3
% 2.18/0.85 % Initial clauses in saturation : 38
% 2.18/0.85 % Processed clauses : 1690
% 2.18/0.85 % ...of these trivial : 103
% 2.18/0.85 % ...subsumed : 1135
% 2.18/0.85 % ...remaining for further processing : 452
% 2.18/0.85 % Other redundant clauses eliminated : 35
% 2.18/0.85 % Clauses deleted for lack of memory : 0
% 2.18/0.85 % Backward-subsumed : 6
% 2.18/0.85 % Backward-rewritten : 17
% 2.18/0.85 % Generated clauses : 8889
% 2.18/0.85 % ...of the previous two non-redundant : 6753
% 2.18/0.85 % ...aggressively subsumed : 0
% 2.18/0.85 % Contextual simplify-reflections : 2
% 2.18/0.85 % Paramodulations : 8798
% 2.18/0.85 % Factorizations : 54
% 2.18/0.85 % NegExts : 0
% 2.18/0.85 % Equation resolutions : 35
% 2.18/0.85 % Disequality decompositions : 0
% 2.18/0.85 % Total rewrite steps : 4866
% 2.18/0.85 % ...of those cached : 4564
% 2.18/0.85 % Propositional unsat checks : 0
% 2.18/0.85 % Propositional check models : 0
% 2.18/0.85 % Propositional check unsatisfiable : 0
% 2.18/0.85 % Propositional clauses : 0
% 2.18/0.85 % Propositional clauses after purity: 0
% 2.18/0.85 % Propositional unsat core size : 0
% 2.18/0.85 % Propositional preprocessing time : 0.000
% 2.18/0.85 % Propositional encoding time : 0.000
% 2.18/0.85 % Propositional solver time : 0.000
% 2.18/0.85 % Success case prop preproc time : 0.000
% 2.18/0.85 % Success case prop encoding time : 0.000
% 2.18/0.85 % Success case prop solver time : 0.000
% 2.18/0.85 % Current number of processed clauses : 383
% 2.18/0.85 % Positive orientable unit clauses : 63
% 2.18/0.85 % Positive unorientable unit clauses: 1
% 2.18/0.85 % Negative unit clauses : 3
% 2.18/0.85 % Non-unit-clauses : 316
% 2.18/0.85 % Current number of unprocessed clauses: 5073
% 2.18/0.85 % ...number of literals in the above : 14447
% 2.18/0.85 % Current number of archived formulas : 0
% 2.18/0.85 % Current number of archived clauses : 61
% 2.18/0.85 % Clause-clause subsumption calls (NU) : 20530
% 2.18/0.85 % Rec. Clause-clause subsumption calls : 14779
% 2.18/0.85 % Non-unit clause-clause subsumptions : 887
% 2.18/0.85 % Unit Clause-clause subsumption calls : 739
% 2.18/0.85 % Rewrite failures with RHS unbound : 0
% 2.18/0.85 % BW rewrite match attempts : 42
% 2.18/0.85 % BW rewrite match successes : 16
% 2.18/0.85 % Condensation attempts : 0
% 2.18/0.85 % Condensation successes : 0
% 2.18/0.85 % Termbank termtop insertions : 100283
% 2.18/0.85 % Search garbage collected termcells : 602
% 2.18/0.85
% 2.18/0.85 % -------------------------------------------------
% 2.18/0.85 % User time : 0.230 s
% 2.18/0.85 % System time : 0.012 s
% 2.18/0.85 % Total time : 0.242 s
% 2.18/0.85 % Maximum resident set size: 3648 pages
% 2.18/0.85
% 2.18/0.85 % -------------------------------------------------
% 2.18/0.85 % User time : 1.285 s
% 2.18/0.85 % System time : 0.072 s
% 2.18/0.85 % Total time : 1.358 s
% 2.18/0.85 % Maximum resident set size: 4864 pages
% 2.18/0.85 % E exiting
%------------------------------------------------------------------------------