TSTP Solution File: ITP020+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP020+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 08:06:35 EDT 2024
% Result : Theorem 0.16s 0.54s
% Output : CNFRefutation 0.16s
% 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] :
( mem(X37,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
& 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)))) ),
file('/export/starexec/sandbox/tmp/tmp.2SBoBNE85f/E---3.1_9615.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] :
( mem(X32,arr(X9,X12))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(X9,X12),X32),X30),X31)) )
<=> ? [X33] :
( mem(X33,arr(X12,X9))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(X12,X9),X33),X31),X30)) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2SBoBNE85f/E---3.1_9615.p',conj_thm_2Epred__set_2EBIJ__SYM) ).
fof(conj_thm_2Eutil__prob_2ENUM__2D__BIJ,axiom,
? [X37] :
( mem(X37,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum))
& 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))) ),
file('/export/starexec/sandbox/tmp/tmp.2SBoBNE85f/E---3.1_9615.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/tmp/tmp.2SBoBNE85f/E---3.1_9615.p',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/tmp/tmp.2SBoBNE85f/E---3.1_9615.p',mem_c_2Epred__set_2ECROSS) ).
fof(ne_ty_2Enum_2Enum,axiom,
ne(ty_2Enum_2Enum),
file('/export/starexec/sandbox/tmp/tmp.2SBoBNE85f/E---3.1_9615.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/tmp/tmp.2SBoBNE85f/E---3.1_9615.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/tmp/tmp.2SBoBNE85f/E---3.1_9615.p',mem_c_2Epred__set_2EUNIV) ).
fof(c_0_8,negated_conjecture,
~ ? [X37] :
( mem(X37,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
& 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)))) ),
inference(assume_negation,[status(cth)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV]) ).
fof(c_0_9,plain,
! [X157,X158,X159,X160,X161,X163] :
( ( mem(esk25_4(X157,X158,X159,X160),arr(X158,X157))
| ~ mem(X161,arr(X157,X158))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X157,X158),X161),X159),X160))
| ~ mem(X160,arr(X158,bool))
| ~ mem(X159,arr(X157,bool))
| ~ ne(X158)
| ~ ne(X157) )
& ( p(ap(ap(ap(c_2Epred__set_2EBIJ(X158,X157),esk25_4(X157,X158,X159,X160)),X160),X159))
| ~ mem(X161,arr(X157,X158))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X157,X158),X161),X159),X160))
| ~ mem(X160,arr(X158,bool))
| ~ mem(X159,arr(X157,bool))
| ~ ne(X158)
| ~ ne(X157) )
& ( mem(esk26_4(X157,X158,X159,X160),arr(X157,X158))
| ~ mem(X163,arr(X158,X157))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X158,X157),X163),X160),X159))
| ~ mem(X160,arr(X158,bool))
| ~ mem(X159,arr(X157,bool))
| ~ ne(X158)
| ~ ne(X157) )
& ( p(ap(ap(ap(c_2Epred__set_2EBIJ(X157,X158),esk26_4(X157,X158,X159,X160)),X159),X160))
| ~ mem(X163,arr(X158,X157))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X158,X157),X163),X160),X159))
| ~ mem(X160,arr(X158,bool))
| ~ mem(X159,arr(X157,bool))
| ~ ne(X158)
| ~ ne(X157) ) ),
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,
( mem(esk24_0,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),esk24_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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ])]) ).
fof(c_0_11,plain,
! [X69,X70,X71,X72] :
( ~ mem(X71,arr(X69,X70))
| ~ mem(X72,X69)
| mem(ap(X71,X72),X70) ),
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,
! [X153,X154] :
( ~ ne(X153)
| ~ ne(X154)
| mem(c_2Epred__set_2ECROSS(X153,X154),arr(arr(X153,bool),arr(arr(X154,bool),arr(ty_2Epair_2Eprod(X153,X154),bool)))) ),
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,
! [X38] :
( ~ mem(X38,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X38),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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk25_4(X2,X1,X3,X4)),X4),X3))
| ~ mem(X5,arr(X2,X1))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X2,X1),X5),X3),X4))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X2,bool))
| ~ ne(X1)
| ~ ne(X2) ),
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),esk24_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(esk24_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,
( mem(esk25_4(X1,X2,X3,X4),arr(X2,X1))
| ~ mem(X5,arr(X1,X2))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),X5),X3),X4))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool))
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( mem(ap(X1,X4),X3)
| ~ mem(X1,arr(X2,X3))
| ~ mem(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( mem(c_2Epred__set_2ECROSS(X1,X2),arr(arr(X1,bool),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool))))
| ~ ne(X1)
| ~ ne(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( ~ mem(X1,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ 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)))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),esk25_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))))
| ~ 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(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(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_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_23,plain,
( mem(esk25_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)))
| ~ 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(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(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,
( mem(ap(c_2Epred__set_2ECROSS(X1,X2),X3),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool)))
| ~ mem(X3,arr(X1,bool))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ 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(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( mem(ap(ap(c_2Epred__set_2ECROSS(X1,X2),X3),X4),arr(ty_2Epair_2Eprod(X1,X2),bool))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
fof(c_0_27,plain,
! [X165,X166] :
( ~ ne(X165)
| ~ ne(X166)
| ne(ty_2Epair_2Eprod(X165,X166)) ),
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,
( ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
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(ty_2Epair_2Eprod(X1,X2))
| ~ ne(X1)
| ~ ne(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X151] :
( ~ ne(X151)
| mem(c_2Epred__set_2EUNIV(X151),arr(X151,bool)) ),
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,
( mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool))
| ~ ne(X1) ),
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.09/0.11 % Problem : ITP020+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 12:32:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/tmp/tmp.2SBoBNE85f/E---3.1_9615.p
% 0.16/0.54 # Version: 3.1.0
% 0.16/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.54 # Starting sh5l with 300s (1) cores
% 0.16/0.54 # new_bool_3 with pid 9695 completed with status 0
% 0.16/0.54 # Result found by new_bool_3
% 0.16/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.54 # Search class: FGHSF-FSLS32-MFFFFFNN
% 0.16/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.54 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 9699 completed with status 0
% 0.16/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 0.16/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.54 # Search class: FGHSF-FSLS32-MFFFFFNN
% 0.16/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.54 # Preprocessing time : 0.003 s
% 0.16/0.54 # Presaturation interreduction done
% 0.16/0.54
% 0.16/0.54 # Proof found!
% 0.16/0.54 # SZS status Theorem
% 0.16/0.54 # SZS output start CNFRefutation
% See solution above
% 0.16/0.54 # Parsed axioms : 63
% 0.16/0.54 # Removed by relevancy pruning/SinE : 22
% 0.16/0.54 # Initial clauses : 356
% 0.16/0.54 # Removed in clause preprocessing : 261
% 0.16/0.54 # Initial clauses in saturation : 95
% 0.16/0.54 # Processed clauses : 407
% 0.16/0.54 # ...of these trivial : 0
% 0.16/0.54 # ...subsumed : 21
% 0.16/0.54 # ...remaining for further processing : 386
% 0.16/0.54 # Other redundant clauses eliminated : 0
% 0.16/0.54 # Clauses deleted for lack of memory : 0
% 0.16/0.54 # Backward-subsumed : 24
% 0.16/0.54 # Backward-rewritten : 0
% 0.16/0.54 # Generated clauses : 1901
% 0.16/0.54 # ...of the previous two non-redundant : 1887
% 0.16/0.54 # ...aggressively subsumed : 0
% 0.16/0.54 # Contextual simplify-reflections : 1
% 0.16/0.54 # Paramodulations : 1900
% 0.16/0.54 # Factorizations : 0
% 0.16/0.54 # NegExts : 0
% 0.16/0.54 # Equation resolutions : 1
% 0.16/0.54 # Disequality decompositions : 0
% 0.16/0.54 # Total rewrite steps : 513
% 0.16/0.54 # ...of those cached : 509
% 0.16/0.54 # Propositional unsat checks : 0
% 0.16/0.54 # Propositional check models : 0
% 0.16/0.54 # Propositional check unsatisfiable : 0
% 0.16/0.54 # Propositional clauses : 0
% 0.16/0.54 # Propositional clauses after purity: 0
% 0.16/0.54 # Propositional unsat core size : 0
% 0.16/0.54 # Propositional preprocessing time : 0.000
% 0.16/0.54 # Propositional encoding time : 0.000
% 0.16/0.54 # Propositional solver time : 0.000
% 0.16/0.54 # Success case prop preproc time : 0.000
% 0.16/0.54 # Success case prop encoding time : 0.000
% 0.16/0.54 # Success case prop solver time : 0.000
% 0.16/0.54 # Current number of processed clauses : 285
% 0.16/0.54 # Positive orientable unit clauses : 4
% 0.16/0.54 # Positive unorientable unit clauses: 0
% 0.16/0.54 # Negative unit clauses : 1
% 0.16/0.54 # Non-unit-clauses : 280
% 0.16/0.54 # Current number of unprocessed clauses: 1644
% 0.16/0.54 # ...number of literals in the above : 10726
% 0.16/0.54 # Current number of archived formulas : 0
% 0.16/0.54 # Current number of archived clauses : 101
% 0.16/0.54 # Clause-clause subsumption calls (NU) : 11873
% 0.16/0.54 # Rec. Clause-clause subsumption calls : 2373
% 0.16/0.54 # Non-unit clause-clause subsumptions : 45
% 0.16/0.54 # Unit Clause-clause subsumption calls : 74
% 0.16/0.54 # Rewrite failures with RHS unbound : 0
% 0.16/0.54 # BW rewrite match attempts : 0
% 0.16/0.54 # BW rewrite match successes : 0
% 0.16/0.54 # Condensation attempts : 0
% 0.16/0.54 # Condensation successes : 0
% 0.16/0.54 # Termbank termtop insertions : 111840
% 0.16/0.54 # Search garbage collected termcells : 5185
% 0.16/0.54
% 0.16/0.54 # -------------------------------------------------
% 0.16/0.54 # User time : 0.083 s
% 0.16/0.54 # System time : 0.005 s
% 0.16/0.54 # Total time : 0.088 s
% 0.16/0.54 # Maximum resident set size: 2724 pages
% 0.16/0.54
% 0.16/0.54 # -------------------------------------------------
% 0.16/0.54 # User time : 0.086 s
% 0.16/0.54 # System time : 0.007 s
% 0.16/0.54 # Total time : 0.093 s
% 0.16/0.54 # Maximum resident set size: 1820 pages
% 0.16/0.54 % E---3.1 exiting
% 0.16/0.54 % E exiting
%------------------------------------------------------------------------------