%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU324+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:28:59 PM UTC 2026
% Result : Theorem 12.61s 2.34s
% Output : CNFRefutation 12.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 22 unt; 0 def)
% Number of atoms : 170 ( 53 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 170 ( 65 ~; 60 |; 20 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 77 ( 2 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t55_tops_1,conjecture,
! [X1] :
( ( top_str(X1)
& topological_space(X1) )
=> ! [X2] :
( top_str(X2)
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ! [X4] :
( element(X4,powerset(the_carrier(X2)))
=> ( ( interior(X1,X3) = X3
=> open_subset(X3,X1) )
& ( open_subset(X4,X2)
=> interior(X2,X4) = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_tops_1) ).
fof(d1_tops_1,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tops_1) ).
fof(t30_tops_1,lemma,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( open_subset(X2,X1)
<=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_tops_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(t52_pre_topc,lemma,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( ( ( topstr_closure(X1,X2) = X2
& topological_space(X1) )
=> closed_subset(X2,X1) )
& ( closed_subset(X2,X1)
=> topstr_closure(X1,X2) = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_pre_topc) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole) ).
fof(fc6_tops_1,axiom,
! [X1,X2] :
( ( element(X2,powerset(the_carrier(X1)))
& top_str(X1)
& topological_space(X1) )
=> open_subset(interior(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_tops_1) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( top_str(X1)
& topological_space(X1) )
=> ! [X2] :
( top_str(X2)
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ! [X4] :
( element(X4,powerset(the_carrier(X2)))
=> ( ( interior(X1,X3) = X3
=> open_subset(X3,X1) )
& ( open_subset(X4,X2)
=> interior(X2,X4) = X4 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t55_tops_1]) ).
fof(c_0_13,negated_conjecture,
( ( interior(esk339_0,esk341_0) != esk341_0
| ~ open_subset(esk340_0,esk338_0) )
& ( interior(esk339_0,esk341_0) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 )
& ( open_subset(esk341_0,esk339_0)
| ~ open_subset(esk340_0,esk338_0) )
& ( open_subset(esk341_0,esk339_0)
| interior(esk338_0,esk340_0) = esk340_0 )
& element(esk341_0,powerset(the_carrier(esk339_0)))
& element(esk340_0,powerset(the_carrier(esk338_0)))
& top_str(esk339_0)
& top_str(esk338_0)
& topological_space(esk338_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_14,plain,
! [X252,X253] :
( interior(X252,X253) = subset_complement(the_carrier(X252),topstr_closure(X252,subset_complement(the_carrier(X252),X253)))
| ~ element(X253,powerset(the_carrier(X252)))
| ~ top_str(X252) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tops_1])])])]) ).
fof(c_0_15,lemma,
! [X1430,X1431] :
( ( ~ top_str(X1430)
| ~ element(X1431,powerset(the_carrier(X1430)))
| open_subset(X1431,X1430)
| ~ closed_subset(subset_complement(the_carrier(X1430),X1431),X1430) )
& ( ~ top_str(X1430)
| ~ element(X1431,powerset(the_carrier(X1430)))
| closed_subset(subset_complement(the_carrier(X1430),X1431),X1430)
| ~ open_subset(X1431,X1430) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_tops_1])])])])]) ).
cnf(c_0_16,negated_conjecture,
( interior(esk339_0,esk341_0) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1)
| interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
top_str(esk339_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
element(esk341_0,powerset(the_carrier(esk339_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X459,X460] :
( subset_complement(X459,X460) = set_difference(X459,X460)
| ~ element(X460,powerset(X459)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
fof(c_0_21,plain,
! [X1477,X1478] :
( ( element(X1477,powerset(X1478))
| ~ subset(X1477,X1478) )
& ( subset(X1477,X1478)
| ~ element(X1477,powerset(X1478)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_22,lemma,
! [X1457,X1458] : subset(set_difference(X1457,X1458),X1457),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
cnf(c_0_23,lemma,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(X1,X2)
| closed_subset(subset_complement(the_carrier(X2),X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( open_subset(esk341_0,esk339_0)
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( interior(esk339_0,esk341_0) != esk341_0
| ~ open_subset(esk340_0,esk338_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( ~ open_subset(esk340_0,esk338_0)
| open_subset(esk341_0,esk339_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
( subset_complement(the_carrier(esk339_0),topstr_closure(esk339_0,subset_complement(the_carrier(esk339_0),esk341_0))) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_28,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_29,lemma,
! [X1558,X1559] :
( ( ~ top_str(X1558)
| ~ element(X1559,powerset(the_carrier(X1558)))
| closed_subset(X1559,X1558)
| topstr_closure(X1558,X1559) != X1559
| ~ topological_space(X1558) )
& ( ~ top_str(X1558)
| ~ element(X1559,powerset(the_carrier(X1558)))
| topstr_closure(X1558,X1559) = X1559
| ~ closed_subset(X1559,X1558) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])])]) ).
cnf(c_0_30,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( closed_subset(subset_complement(the_carrier(esk339_0),esk341_0),esk339_0)
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_19])]) ).
fof(c_0_33,plain,
! [X75,X76] : set_intersection2(X75,X76) = set_intersection2(X76,X75),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_34,lemma,
! [X1537,X1538] : set_difference(X1537,set_difference(X1537,X1538)) = set_intersection2(X1537,X1538),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_35,negated_conjecture,
( ~ open_subset(esk340_0,esk338_0)
| subset_complement(the_carrier(esk339_0),topstr_closure(esk339_0,subset_complement(the_carrier(esk339_0),esk341_0))) != esk341_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_36,negated_conjecture,
( ~ open_subset(esk340_0,esk338_0)
| closed_subset(subset_complement(the_carrier(esk339_0),esk341_0),esk339_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_18]),c_0_19])]) ).
cnf(c_0_37,negated_conjecture,
( subset_complement(the_carrier(esk339_0),topstr_closure(esk339_0,set_difference(the_carrier(esk339_0),esk341_0))) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19])]) ).
cnf(c_0_38,lemma,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ closed_subset(X1,X2)
| topstr_closure(X2,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,lemma,
element(set_difference(X1,X2),powerset(X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( closed_subset(set_difference(the_carrier(esk339_0),esk341_0),esk339_0)
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_19])]) ).
cnf(c_0_41,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( ~ open_subset(esk340_0,esk338_0)
| subset_complement(the_carrier(esk339_0),topstr_closure(esk339_0,set_difference(the_carrier(esk339_0),esk341_0))) != esk341_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_19])]) ).
cnf(c_0_44,negated_conjecture,
( ~ open_subset(esk340_0,esk338_0)
| closed_subset(set_difference(the_carrier(esk339_0),esk341_0),esk339_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_19])]) ).
cnf(c_0_45,lemma,
( subset_complement(the_carrier(esk339_0),set_difference(the_carrier(esk339_0),esk341_0)) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18]),c_0_39])]),c_0_40]) ).
cnf(c_0_46,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42]) ).
fof(c_0_47,lemma,
! [X747,X748] :
( ( set_difference(X747,X748) = empty_set
| ~ subset(X747,X748) )
& ( subset(X747,X748)
| set_difference(X747,X748) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])])]) ).
fof(c_0_48,plain,
! [X1473] : set_difference(X1473,empty_set) = X1473,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_49,lemma,
( ~ open_subset(esk340_0,esk338_0)
| subset_complement(the_carrier(esk339_0),set_difference(the_carrier(esk339_0),esk341_0)) != esk341_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_18]),c_0_39])]),c_0_44]) ).
cnf(c_0_50,lemma,
( set_difference(esk341_0,set_difference(esk341_0,the_carrier(esk339_0))) != esk341_0
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_46]),c_0_39])]) ).
cnf(c_0_51,lemma,
( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_53,lemma,
( ~ open_subset(esk340_0,esk338_0)
| set_difference(esk341_0,set_difference(esk341_0,the_carrier(esk339_0))) != esk341_0 ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_28]),c_0_39])]),c_0_46]) ).
fof(c_0_54,plain,
! [X704,X705] :
( open_subset(interior(X704,X705),X704)
| ~ element(X705,powerset(the_carrier(X704)))
| ~ top_str(X704)
| ~ topological_space(X704) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_tops_1])])]) ).
cnf(c_0_55,lemma,
( ~ subset(esk341_0,the_carrier(esk339_0))
| interior(esk338_0,esk340_0) = esk340_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_56,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_57,lemma,
( ~ subset(esk341_0,the_carrier(esk339_0))
| ~ open_subset(esk340_0,esk338_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_52])]) ).
cnf(c_0_58,plain,
( ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ topological_space(X1)
| open_subset(interior(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,lemma,
interior(esk338_0,esk340_0) = esk340_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_19])]) ).
cnf(c_0_60,negated_conjecture,
topological_space(esk338_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_61,negated_conjecture,
top_str(esk338_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_62,negated_conjecture,
element(esk340_0,powerset(the_carrier(esk338_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_63,lemma,
~ open_subset(esk340_0,esk338_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_56]),c_0_19])]) ).
cnf(c_0_64,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61]),c_0_62])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU324+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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 06:16:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 12.61/2.34 % Version: 3.5.1
% 12.61/2.34 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.61/2.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.61/2.34 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.61/2.34 % Starting new_bool_3 with 600s (2) cores
% 12.61/2.34 % Starting new_bool_1 with 600s (2) cores
% 12.61/2.34 % Starting sh5l with 300s (1) cores
% 12.61/2.34 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1733459 completed with status 0
% 12.61/2.34 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 12.61/2.34 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.61/2.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.61/2.34 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.61/2.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.61/2.34 % No SInE strategy applied
% 12.61/2.34 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.61/2.34 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 12.61/2.34 % Starting SubtermCWHack with 82s (1) cores
% 12.61/2.34 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 12.61/2.34 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 12.61/2.34 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1733519 completed with status 0
% 12.61/2.34 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 12.61/2.34 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.61/2.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.61/2.34 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.61/2.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.61/2.34 % No SInE strategy applied
% 12.61/2.34 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.61/2.34 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 12.61/2.34 % Starting SubtermCWHack with 82s (1) cores
% 12.61/2.34 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 12.61/2.34 % Preprocessing time : 0.039 s
% 12.61/2.34 % Presaturation interreduction done
% 12.61/2.34
% 12.61/2.34 % Proof found!
% 12.61/2.34 % SZS status Theorem
% 12.61/2.34 % SZS output start CNFRefutation
% See solution above
% 12.61/2.34 % Parsed axioms : 535
% 12.61/2.34 % Removed by relevancy pruning/SinE : 0
% 12.61/2.34 % Initial clauses : 2092
% 12.61/2.34 % Removed in clause preprocessing : 40
% 12.61/2.34 % Initial clauses in saturation : 2052
% 12.61/2.34 % Processed clauses : 7846
% 12.61/2.34 % ...of these trivial : 50
% 12.61/2.34 % ...subsumed : 3222
% 12.61/2.34 % ...remaining for further processing : 4574
% 12.61/2.34 % Other redundant clauses eliminated : 561
% 12.61/2.34 % Clauses deleted for lack of memory : 0
% 12.61/2.34 % Backward-subsumed : 268
% 12.61/2.34 % Backward-rewritten : 92
% 12.61/2.34 % Generated clauses : 18681
% 12.61/2.34 % ...of the previous two non-redundant : 17027
% 12.61/2.34 % ...aggressively subsumed : 0
% 12.61/2.34 % Contextual simplify-reflections : 225
% 12.61/2.34 % Paramodulations : 18255
% 12.61/2.34 % Factorizations : 0
% 12.61/2.34 % NegExts : 0
% 12.61/2.34 % Equation resolutions : 566
% 12.61/2.34 % Disequality decompositions : 0
% 12.61/2.34 % Total rewrite steps : 3378
% 12.61/2.34 % ...of those cached : 3051
% 12.61/2.34 % Propositional unsat checks : 0
% 12.61/2.34 % Propositional check models : 0
% 12.61/2.34 % Propositional check unsatisfiable : 0
% 12.61/2.34 % Propositional clauses : 0
% 12.61/2.34 % Propositional clauses after purity: 0
% 12.61/2.34 % Propositional unsat core size : 0
% 12.61/2.34 % Propositional preprocessing time : 0.000
% 12.61/2.34 % Propositional encoding time : 0.000
% 12.61/2.34 % Propositional solver time : 0.000
% 12.61/2.34 % Success case prop preproc time : 0.000
% 12.61/2.34 % Success case prop encoding time : 0.000
% 12.61/2.34 % Success case prop solver time : 0.000
% 12.61/2.34 % Current number of processed clauses : 1921
% 12.61/2.34 % Positive orientable unit clauses : 192
% 12.61/2.34 % Positive unorientable unit clauses: 3
% 12.61/2.34 % Negative unit clauses : 398
% 12.61/2.34 % Non-unit-clauses : 1328
% 12.61/2.34 % Current number of unprocessed clauses: 12653
% 12.61/2.34 % ...number of literals in the above : 43892
% 12.61/2.34 % Current number of archived formulas : 0
% 12.61/2.34 % Current number of archived clauses : 2266
% 12.61/2.34 % Clause-clause subsumption calls (NU) : 2447491
% 12.61/2.34 % Rec. Clause-clause subsumption calls : 634775
% 12.61/2.34 % Non-unit clause-clause subsumptions : 2006
% 12.61/2.34 % Unit Clause-clause subsumption calls : 64815
% 12.61/2.34 % Rewrite failures with RHS unbound : 0
% 12.61/2.34 % BW rewrite match attempts : 112
% 12.61/2.34 % BW rewrite match successes : 78
% 12.61/2.34 % Condensation attempts : 0
% 12.61/2.34 % Condensation successes : 0
% 12.61/2.34 % Termbank termtop insertions : 360447
% 12.61/2.34 % Search garbage collected termcells : 28953
% 12.61/2.34
% 12.61/2.34 % -------------------------------------------------
% 12.61/2.34 % User time : 1.638 s
% 12.61/2.34 % System time : 0.054 s
% 12.61/2.34 % Total time : 1.693 s
% 12.61/2.34 % Maximum resident set size: 9200 pages
% 12.61/2.34
% 12.61/2.34 % -------------------------------------------------
% 12.61/2.34 % User time : 4.949 s
% 12.61/2.34 % System time : 0.168 s
% 12.61/2.34 % Total time : 5.117 s
% 12.61/2.34 % Maximum resident set size: 5632 pages
% 12.61/2.34 % E exiting
%------------------------------------------------------------------------------