TSTP Solution File: SEU174+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU174+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Sat May 4 09:30:39 EDT 2024
% Result : Theorem 0.68s 0.57s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 70 ( 30 unt; 0 def)
% Number of atoms : 175 ( 51 equ)
% Maximal formula atoms : 26 ( 2 avg)
% Number of connectives : 178 ( 73 ~; 60 |; 26 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 121 ( 9 sgn 75 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',d1_xboole_0) ).
fof(t46_setfam_1,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( X2 != empty_set
& complements_of_subsets(X1,X2) = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t46_setfam_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',rc1_xboole_0) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',involutiveness_k7_setfam_1) ).
fof(d8_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ! [X3] :
( element(X3,powerset(powerset(X1)))
=> ( X3 = complements_of_subsets(X1,X2)
<=> ! [X4] :
( element(X4,powerset(X1))
=> ( in(X4,X3)
<=> in(subset_complement(X1,X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',d8_setfam_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t4_subset) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',dt_k7_setfam_1) ).
fof(l71_subset_1,lemma,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',l71_subset_1) ).
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/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t3_xboole_0) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t2_boole) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t48_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t3_boole) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t28_xboole_1) ).
fof(t83_xboole_1,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',t83_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.89as2T1uyN/E---3.1_16891.p',d3_tarski) ).
fof(c_0_16,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( X2 != empty_set
& complements_of_subsets(X1,X2) = empty_set ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t46_setfam_1])]) ).
fof(c_0_18,plain,
! [X26,X27,X28] :
( ( X26 != empty_set
| ~ in(X27,X26) )
& ( in(esk2_1(X28),X28)
| X28 = 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_16])])])])])]) ).
fof(c_0_19,plain,
! [X295] :
( ~ empty(X295)
| X295 = empty_set ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_20,plain,
empty(esk21_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_21,plain,
! [X139,X140] :
( ~ element(X140,powerset(powerset(X139)))
| complements_of_subsets(X139,complements_of_subsets(X139,X140)) = X140 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])])]) ).
fof(c_0_22,negated_conjecture,
( element(esk28_0,powerset(powerset(esk27_0)))
& esk28_0 != empty_set
& complements_of_subsets(esk27_0,esk28_0) = empty_set ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_23,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
empty(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X115,X116,X117,X118] :
( ( ~ in(X118,X117)
| in(subset_complement(X115,X118),X116)
| ~ element(X118,powerset(X115))
| X117 != complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( ~ in(subset_complement(X115,X118),X116)
| in(X118,X117)
| ~ element(X118,powerset(X115))
| X117 != complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( element(esk17_3(X115,X116,X117),powerset(X115))
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( ~ in(esk17_3(X115,X116,X117),X117)
| ~ in(subset_complement(X115,esk17_3(X115,X116,X117)),X116)
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( in(esk17_3(X115,X116,X117),X117)
| in(subset_complement(X115,esk17_3(X115,X116,X117)),X116)
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) ) ),
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)],[d8_setfam_1])])])])])]) ).
fof(c_0_27,plain,
! [X269,X270,X271] :
( ~ in(X269,X270)
| ~ element(X270,powerset(X271))
| element(X269,X271) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_28,plain,
! [X124,X125] :
( ~ element(X125,powerset(powerset(X124)))
| element(complements_of_subsets(X124,X125),powerset(powerset(X124))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])])]) ).
cnf(c_0_29,plain,
( complements_of_subsets(X2,complements_of_subsets(X2,X1)) = X1
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
complements_of_subsets(esk27_0,esk28_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
element(esk28_0,powerset(powerset(esk27_0))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
empty_set = esk21_0,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_34,lemma,
! [X167,X168] :
( ( in(esk19_2(X167,X168),X167)
| element(X167,powerset(X168)) )
& ( ~ in(esk19_2(X167,X168),X168)
| element(X167,powerset(X168)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])])]) ).
cnf(c_0_35,plain,
( in(subset_complement(X3,X1),X4)
| ~ in(X1,X2)
| ~ element(X1,powerset(X3))
| X2 != complements_of_subsets(X3,X4)
| ~ element(X2,powerset(powerset(X3)))
| ~ element(X4,powerset(powerset(X3))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( element(complements_of_subsets(X2,X1),powerset(powerset(X2)))
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
complements_of_subsets(esk27_0,empty_set) = esk28_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
~ in(X1,esk21_0),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,lemma,
( in(esk19_2(X1,X2),X1)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_41,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_42,plain,
! [X218] : set_intersection2(X218,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_43,lemma,
! [X266,X267] : set_difference(X266,set_difference(X266,X267)) = set_intersection2(X266,X267),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_44,plain,
( in(subset_complement(X1,X2),X3)
| ~ element(X3,powerset(powerset(X1)))
| ~ in(X2,complements_of_subsets(X1,X3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_35,c_0_36])]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
complements_of_subsets(esk27_0,esk21_0) = esk28_0,
inference(rw,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_46,lemma,
element(esk21_0,powerset(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_47,lemma,
! [X248,X249,X251,X252,X253] :
( ( in(esk26_2(X248,X249),X248)
| disjoint(X248,X249) )
& ( in(esk26_2(X248,X249),X249)
| disjoint(X248,X249) )
& ( ~ in(X253,X251)
| ~ in(X253,X252)
| ~ disjoint(X251,X252) ) ),
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_41])])])])])])]) ).
cnf(c_0_48,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_50,plain,
! [X245] : set_difference(X245,empty_set) = X245,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_51,lemma,
! [X216,X217] :
( ~ subset(X216,X217)
| set_intersection2(X216,X217) = X216 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).
fof(c_0_52,lemma,
! [X302,X303] :
( ( ~ disjoint(X302,X303)
| set_difference(X302,X303) = X302 )
& ( set_difference(X302,X303) != X302
| disjoint(X302,X303) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])]) ).
cnf(c_0_53,negated_conjecture,
~ in(X1,esk28_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_39]) ).
cnf(c_0_54,lemma,
( in(esk26_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_57,plain,
! [X74,X75,X76,X77,X78] :
( ( ~ subset(X74,X75)
| ~ in(X76,X74)
| in(X76,X75) )
& ( in(esk11_2(X77,X78),X77)
| subset(X77,X78) )
& ( ~ in(esk11_2(X77,X78),X78)
| subset(X77,X78) ) ),
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_58,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,lemma,
disjoint(esk28_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( in(esk11_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_63,negated_conjecture,
esk28_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_64,lemma,
( set_difference(X1,set_difference(X1,X2)) = X1
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_58,c_0_49]) ).
cnf(c_0_65,lemma,
set_difference(esk28_0,X1) = esk28_0,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
set_difference(X1,X1) = esk21_0,
inference(rw,[status(thm)],[c_0_61,c_0_33]) ).
cnf(c_0_67,negated_conjecture,
subset(esk28_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
esk28_0 != esk21_0,
inference(rw,[status(thm)],[c_0_63,c_0_33]) ).
cnf(c_0_69,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67])]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU174+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 07:50:48 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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/tmp/tmp.89as2T1uyN/E---3.1_16891.p
% 0.68/0.57 # Version: 3.1.0
% 0.68/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.57 # Starting sh5l with 300s (1) cores
% 0.68/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16994 completed with status 0
% 0.68/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.68/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.57 # No SInE strategy applied
% 0.68/0.57 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.68/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.57 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 675s (1) cores
% 0.68/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.68/0.57 # Starting new_bool_3 with 169s (1) cores
% 0.68/0.57 # Starting new_bool_1 with 169s (1) cores
% 0.68/0.57 # Starting sh5l with 169s (1) cores
% 0.68/0.57 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 17008 completed with status 0
% 0.68/0.57 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.68/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.57 # No SInE strategy applied
% 0.68/0.57 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.68/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.57 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 675s (1) cores
% 0.68/0.57 # Preprocessing time : 0.002 s
% 0.68/0.57
% 0.68/0.57 # Proof found!
% 0.68/0.57 # SZS status Theorem
% 0.68/0.57 # SZS output start CNFRefutation
% See solution above
% 0.68/0.57 # Parsed axioms : 122
% 0.68/0.57 # Removed by relevancy pruning/SinE : 0
% 0.68/0.57 # Initial clauses : 211
% 0.68/0.57 # Removed in clause preprocessing : 14
% 0.68/0.57 # Initial clauses in saturation : 197
% 0.68/0.57 # Processed clauses : 451
% 0.68/0.57 # ...of these trivial : 15
% 0.68/0.57 # ...subsumed : 136
% 0.68/0.57 # ...remaining for further processing : 300
% 0.68/0.57 # Other redundant clauses eliminated : 127
% 0.68/0.57 # Clauses deleted for lack of memory : 0
% 0.68/0.57 # Backward-subsumed : 18
% 0.68/0.57 # Backward-rewritten : 28
% 0.68/0.57 # Generated clauses : 4326
% 0.68/0.57 # ...of the previous two non-redundant : 3984
% 0.68/0.57 # ...aggressively subsumed : 0
% 0.68/0.57 # Contextual simplify-reflections : 3
% 0.68/0.57 # Paramodulations : 4162
% 0.68/0.57 # Factorizations : 36
% 0.68/0.57 # NegExts : 0
% 0.68/0.57 # Equation resolutions : 132
% 0.68/0.57 # Disequality decompositions : 0
% 0.68/0.57 # Total rewrite steps : 517
% 0.68/0.57 # ...of those cached : 428
% 0.68/0.57 # Propositional unsat checks : 0
% 0.68/0.57 # Propositional check models : 0
% 0.68/0.57 # Propositional check unsatisfiable : 0
% 0.68/0.57 # Propositional clauses : 0
% 0.68/0.57 # Propositional clauses after purity: 0
% 0.68/0.57 # Propositional unsat core size : 0
% 0.68/0.57 # Propositional preprocessing time : 0.000
% 0.68/0.57 # Propositional encoding time : 0.000
% 0.68/0.57 # Propositional solver time : 0.000
% 0.68/0.57 # Success case prop preproc time : 0.000
% 0.68/0.57 # Success case prop encoding time : 0.000
% 0.68/0.57 # Success case prop solver time : 0.000
% 0.68/0.57 # Current number of processed clauses : 221
% 0.68/0.57 # Positive orientable unit clauses : 39
% 0.68/0.57 # Positive unorientable unit clauses: 3
% 0.68/0.57 # Negative unit clauses : 41
% 0.68/0.57 # Non-unit-clauses : 138
% 0.68/0.57 # Current number of unprocessed clauses: 3661
% 0.68/0.57 # ...number of literals in the above : 12495
% 0.68/0.57 # Current number of archived formulas : 0
% 0.68/0.57 # Current number of archived clauses : 49
% 0.68/0.57 # Clause-clause subsumption calls (NU) : 4734
% 0.68/0.57 # Rec. Clause-clause subsumption calls : 3002
% 0.68/0.57 # Non-unit clause-clause subsumptions : 26
% 0.68/0.57 # Unit Clause-clause subsumption calls : 1855
% 0.68/0.57 # Rewrite failures with RHS unbound : 0
% 0.68/0.57 # BW rewrite match attempts : 55
% 0.68/0.57 # BW rewrite match successes : 19
% 0.68/0.57 # Condensation attempts : 451
% 0.68/0.57 # Condensation successes : 20
% 0.68/0.57 # Termbank termtop insertions : 56175
% 0.68/0.57 # Search garbage collected termcells : 3100
% 0.68/0.57
% 0.68/0.57 # -------------------------------------------------
% 0.68/0.57 # User time : 0.060 s
% 0.68/0.57 # System time : 0.008 s
% 0.68/0.57 # Total time : 0.068 s
% 0.68/0.57 # Maximum resident set size: 2420 pages
% 0.68/0.57
% 0.68/0.57 # -------------------------------------------------
% 0.68/0.57 # User time : 0.271 s
% 0.68/0.57 # System time : 0.018 s
% 0.68/0.57 # Total time : 0.290 s
% 0.68/0.57 # Maximum resident set size: 1808 pages
% 0.68/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------