%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP020+2 : TPTP v9.3.1. Bugfixed v7.5.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 12:53:48 PM UTC 2026
% Result : Theorem 88.01s 13.29s
% Output : CNFRefutation 88.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 163 ( 74 ~; 68 |; 9 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 61 ( 0 sgn 29 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV,conjecture,
? [X37] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X37),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
& mem(X37,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV) ).
fof(conj_thm_2Epred__set_2EBIJ__SYM,axiom,
! [X9] :
( ne(X9)
=> ! [X12] :
( ne(X12)
=> ! [X30] :
( mem(X30,arr(X9,bool))
=> ! [X31] :
( mem(X31,arr(X12,bool))
=> ( ? [X32] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X9,X12),X32),X30),X31))
& mem(X32,arr(X9,X12)) )
<=> ? [X33] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X12,X9),X33),X31),X30))
& mem(X33,arr(X12,X9)) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EBIJ__SYM) ).
fof(conj_thm_2Eutil__prob_2ENUM__2D__BIJ,axiom,
? [X37] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),X37),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))
& mem(X37,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Eutil__prob_2ENUM__2D__BIJ) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(mem_c_2Epred__set_2ECROSS,axiom,
! [X9] :
( ne(X9)
=> ! [X12] :
( ne(X12)
=> mem(c_2Epred__set_2ECROSS(X9,X12),arr(arr(X9,bool),arr(arr(X12,bool),arr(ty_2Epair_2Eprod(X9,X12),bool)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECROSS) ).
fof(ne_ty_2Enum_2Enum,axiom,
ne(ty_2Enum_2Enum),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ne_ty_2Enum_2Enum) ).
fof(ne_ty_2Epair_2Eprod,axiom,
! [X10] :
( ne(X10)
=> ! [X11] :
( ne(X11)
=> ne(ty_2Epair_2Eprod(X10,X11)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ne_ty_2Epair_2Eprod) ).
fof(mem_c_2Epred__set_2EUNIV,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2EUNIV(X9),arr(X9,bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2EUNIV) ).
fof(c_0_8,negated_conjecture,
~ ? [X37] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X37),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
& mem(X37,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
inference(assume_negation,[status(cth)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV]) ).
fof(c_0_9,plain,
! [X168,X169,X170,X171,X172,X174] :
( ( ~ ne(X168)
| ~ ne(X169)
| ~ mem(X170,arr(X168,bool))
| ~ mem(X171,arr(X169,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X169,X168),X174),X171),X170))
| ~ mem(X174,arr(X169,X168))
| p(ap(ap(ap(c_2Epred__set_2EBIJ(X168,X169),esk27_4(X168,X169,X170,X171)),X170),X171)) )
& ( ~ ne(X168)
| ~ ne(X169)
| ~ mem(X170,arr(X168,bool))
| ~ mem(X171,arr(X169,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X169,X168),X174),X171),X170))
| ~ mem(X174,arr(X169,X168))
| mem(esk27_4(X168,X169,X170,X171),arr(X168,X169)) )
& ( ~ ne(X168)
| ~ ne(X169)
| ~ mem(X170,arr(X168,bool))
| ~ mem(X171,arr(X169,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X168,X169),X172),X170),X171))
| ~ mem(X172,arr(X168,X169))
| p(ap(ap(ap(c_2Epred__set_2EBIJ(X169,X168),esk26_4(X168,X169,X170,X171)),X171),X170)) )
& ( ~ ne(X168)
| ~ ne(X169)
| ~ mem(X170,arr(X168,bool))
| ~ mem(X171,arr(X169,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X168,X169),X172),X170),X171))
| ~ mem(X172,arr(X168,X169))
| mem(esk26_4(X168,X169,X170,X171),arr(X169,X168)) ) ),
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)],[conj_thm_2Epred__set_2EBIJ__SYM])])])])])]) ).
fof(c_0_10,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),esk28_0),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))
& mem(esk28_0,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ])]) ).
fof(c_0_11,plain,
! [X40,X41,X42,X43] :
( mem(ap(X42,X43),X41)
| ~ mem(X43,X40)
| ~ mem(X42,arr(X40,X41)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
fof(c_0_12,plain,
! [X75,X76] :
( mem(c_2Epred__set_2ECROSS(X75,X76),arr(arr(X75,bool),arr(arr(X76,bool),arr(ty_2Epair_2Eprod(X75,X76),bool))))
| ~ ne(X76)
| ~ ne(X75) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ECROSS])])])]) ).
fof(c_0_13,negated_conjecture,
! [X197] :
( ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X197),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
| ~ mem(X197,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( ~ ne(X2)
| ~ ne(X1)
| ~ mem(X3,arr(X2,bool))
| ~ mem(X4,arr(X1,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X2,X1),X5),X3),X4))
| ~ mem(X5,arr(X2,X1))
| p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk26_4(X2,X1,X3,X4)),X4),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),esk28_0),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
mem(esk28_0,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
ne(ty_2Enum_2Enum),
inference(split_conjunct,[status(thm)],[ne_ty_2Enum_2Enum]) ).
cnf(c_0_18,plain,
( ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X2,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),X5),X3),X4))
| ~ mem(X5,arr(X1,X2))
| mem(esk26_4(X1,X2,X3,X4),arr(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( ~ mem(X4,X2)
| ~ mem(X1,arr(X2,X3))
| mem(ap(X1,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ ne(X2)
| ~ ne(X1)
| mem(c_2Epred__set_2ECROSS(X1,X2),arr(arr(X1,bool),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool)))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X1),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
| ~ mem(X1,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool))
| p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),esk26_4(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum,ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_23,plain,
( ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool))
| mem(esk26_4(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum,ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_24,plain,
( ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,bool))
| mem(ap(c_2Epred__set_2ECROSS(X1,X2),X3),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X2,bool))
| mem(ap(ap(c_2Epred__set_2ECROSS(X1,X2),X3),X4),arr(ty_2Epair_2Eprod(X1,X2),bool)) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
fof(c_0_27,plain,
! [X73,X74] :
( ne(ty_2Epair_2Eprod(X73,X74))
| ~ ne(X74)
| ~ ne(X73) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ne_ty_2Epair_2Eprod])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17])]) ).
cnf(c_0_29,plain,
( ~ ne(X2)
| ~ ne(X1)
| ne(ty_2Epair_2Eprod(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X72] :
( mem(c_2Epred__set_2EUNIV(X72),arr(X72,bool))
| ~ ne(X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2EUNIV])])]) ).
cnf(c_0_31,negated_conjecture,
~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17])]) ).
cnf(c_0_32,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP020+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/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 : Sun Sep 20 21:57:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 88.01/13.29 % Version: 3.5.1
% 88.01/13.29 % Preprocessing class: FSLSSMSMSSSNFFN.
% 88.01/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.01/13.29 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 88.01/13.29 % Starting new_bool_3 with 300s (1) cores
% 88.01/13.29 % Starting new_bool_1 with 300s (1) cores
% 88.01/13.29 % Starting sh5l with 300s (1) cores
% 88.01/13.29 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 858495 completed with status 0
% 88.01/13.29 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 88.01/13.29 % Preprocessing class: FSLSSMSMSSSNFFN.
% 88.01/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.01/13.29 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 88.01/13.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.01/13.29 % No SInE strategy applied
% 88.01/13.29 % Search class: FGHSF-FSLM32-MFFFFFNN
% 88.01/13.29 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 88.01/13.29 % Starting SubtermCWHack with 151s (1) cores
% 88.01/13.29 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 88.01/13.29 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 88.01/13.29 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 88.01/13.29 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 146s (1) cores
% 88.01/13.29 % G-E--_302_C18_F1_URBAN_S0Y with pid 858514 completed with status 0
% 88.01/13.29 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 88.01/13.29 % Preprocessing class: FSLSSMSMSSSNFFN.
% 88.01/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.01/13.29 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 88.01/13.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.01/13.29 % No SInE strategy applied
% 88.01/13.29 % Search class: FGHSF-FSLM32-MFFFFFNN
% 88.01/13.29 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 88.01/13.29 % Starting SubtermCWHack with 151s (1) cores
% 88.01/13.29 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 88.01/13.29 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 88.01/13.29 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 88.01/13.29 % Preprocessing time : 0.022 s
% 88.01/13.29
% 88.01/13.29 % Proof found!
% 88.01/13.29 % SZS status Theorem
% 88.01/13.29 % SZS output start CNFRefutation
% See solution above
% 88.01/13.29 % Parsed axioms : 63
% 88.01/13.29 % Removed by relevancy pruning/SinE : 0
% 88.01/13.29 % Initial clauses : 390
% 88.01/13.29 % Removed in clause preprocessing : 262
% 88.01/13.29 % Initial clauses in saturation : 128
% 88.01/13.29 % Processed clauses : 4192
% 88.01/13.29 % ...of these trivial : 10
% 88.01/13.29 % ...subsumed : 1793
% 88.01/13.29 % ...remaining for further processing : 2389
% 88.01/13.29 % Other redundant clauses eliminated : 3
% 88.01/13.29 % Clauses deleted for lack of memory : 0
% 88.01/13.29 % Backward-subsumed : 172
% 88.01/13.29 % Backward-rewritten : 100
% 88.01/13.29 % Generated clauses : 187130
% 88.01/13.29 % ...of the previous two non-redundant : 184672
% 88.01/13.29 % ...aggressively subsumed : 0
% 88.01/13.29 % Contextual simplify-reflections : 208
% 88.01/13.29 % Paramodulations : 187049
% 88.01/13.29 % Factorizations : 77
% 88.01/13.29 % NegExts : 0
% 88.01/13.29 % Equation resolutions : 4
% 88.01/13.29 % Disequality decompositions : 0
% 88.01/13.29 % Total rewrite steps : 66532
% 88.01/13.29 % ...of those cached : 66504
% 88.01/13.29 % Propositional unsat checks : 0
% 88.01/13.29 % Propositional check models : 0
% 88.01/13.29 % Propositional check unsatisfiable : 0
% 88.01/13.29 % Propositional clauses : 0
% 88.01/13.29 % Propositional clauses after purity: 0
% 88.01/13.29 % Propositional unsat core size : 0
% 88.01/13.29 % Propositional preprocessing time : 0.000
% 88.01/13.29 % Propositional encoding time : 0.000
% 88.01/13.29 % Propositional solver time : 0.000
% 88.01/13.29 % Success case prop preproc time : 0.000
% 88.01/13.29 % Success case prop encoding time : 0.000
% 88.01/13.29 % Success case prop solver time : 0.000
% 88.01/13.29 % Current number of processed clauses : 2116
% 88.01/13.29 % Positive orientable unit clauses : 23
% 88.01/13.29 % Positive unorientable unit clauses: 0
% 88.01/13.29 % Negative unit clauses : 3
% 88.01/13.29 % Non-unit-clauses : 2090
% 88.01/13.29 % Current number of unprocessed clauses: 180074
% 88.01/13.29 % ...number of literals in the above : 2017049
% 88.01/13.29 % Current number of archived formulas : 0
% 88.01/13.29 % Current number of archived clauses : 272
% 88.01/13.29 % Clause-clause subsumption calls (NU) : 1028745
% 88.01/13.29 % Rec. Clause-clause subsumption calls : 42838
% 88.01/13.29 % Non-unit clause-clause subsumptions : 1735
% 88.01/13.29 % Unit Clause-clause subsumption calls : 3874
% 88.01/13.29 % Rewrite failures with RHS unbound : 0
% 88.01/13.29 % BW rewrite match attempts : 19
% 88.01/13.29 % BW rewrite match successes : 14
% 88.01/13.29 % Condensation attempts : 0
% 88.01/13.29 % Condensation successes : 0
% 88.01/13.29 % Termbank termtop insertions : 9470023
% 88.01/13.29 % Search garbage collected termcells : 5516
% 88.01/13.29
% 88.01/13.29 % -------------------------------------------------
% 88.01/13.29 % User time : 11.725 s
% 88.01/13.29 % System time : 0.270 s
% 88.01/13.29 % Total time : 11.996 s
% 88.01/13.29 % Maximum resident set size: 4468 pages
% 88.01/13.29
% 88.01/13.29 % -------------------------------------------------
% 88.01/13.29 % User time : 60.484 s
% 88.01/13.29 % System time : 1.833 s
% 88.01/13.29 % Total time : 62.317 s
% 88.01/13.29 % Maximum resident set size: 4608 pages
% 88.01/13.29 % E exiting
%------------------------------------------------------------------------------