TSTP Solution File: NUN068+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUN068+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:08:35 EDT 2024
% Result : Theorem 11.56s 1.87s
% Output : CNFRefutation 11.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 10 unt; 0 def)
% Number of atoms : 251 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 298 ( 121 ~; 124 |; 53 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 1 con; 0-2 aty)
% Number of variables : 163 ( 12 sgn 78 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_9,axiom,
! [X22,X23,X24,X25] :
( ~ id(X22,X24)
| ~ id(X23,X25)
| ( ~ r2(X22,X23)
& ~ r2(X24,X25) )
| ( r2(X22,X23)
& r2(X24,X25) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_9) ).
fof(nonzerosnononesexistid,conjecture,
? [X63] :
( ! [X46] :
( ! [X47] :
( ~ r1(X47)
| ~ r2(X47,X46) )
| ~ id(X63,X46) )
& ! [X40] :
( ~ id(X63,X40)
| ~ r1(X40) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',nonzerosnononesexistid) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_6) ).
fof(axiom_7,axiom,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_7) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_1) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_4a) ).
fof(axiom_3a,axiom,
! [X50,X51] :
( ! [X52] :
( ! [X53] :
( ~ id(X53,X52)
| ~ r2(X50,X53) )
| ~ r2(X51,X52) )
| id(X50,X51) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_3a) ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_7a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_2) ).
fof(axiom_2a,axiom,
! [X44,X45] :
? [X46] :
( ? [X47] :
( id(X47,X46)
& ? [X48] :
( r2(X45,X48)
& r4(X44,X48,X47) ) )
& ? [X49] :
( r3(X49,X44,X46)
& r4(X44,X45,X49) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_2a) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_8) ).
fof(axiom_5a,axiom,
! [X57] :
? [X58] :
( ? [X59] :
( r1(X59)
& r4(X57,X59,X58) )
& ? [X60] :
( id(X58,X60)
& r1(X60) ) ),
file('/export/starexec/sandbox/tmp/tmp.I5qBxe5fba/E---3.1_30914.p',axiom_5a) ).
fof(c_0_12,plain,
! [X22,X23,X24,X25] :
( ~ id(X22,X24)
| ~ id(X23,X25)
| ( ~ r2(X22,X23)
& ~ r2(X24,X25) )
| ( r2(X22,X23)
& r2(X24,X25) ) ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
fof(c_0_13,negated_conjecture,
~ ? [X63] :
( ! [X46] :
( ! [X47] :
( ~ r1(X47)
| ~ r2(X47,X46) )
| ~ id(X63,X46) )
& ! [X40] :
( ~ id(X63,X40)
| ~ r1(X40) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerosnononesexistid])]) ).
fof(c_0_14,plain,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_15,plain,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
fof(c_0_16,plain,
! [X89,X90,X91,X92] :
( ( r2(X89,X90)
| ~ r2(X89,X90)
| ~ id(X89,X91)
| ~ id(X90,X92) )
& ( r2(X91,X92)
| ~ r2(X89,X90)
| ~ id(X89,X91)
| ~ id(X90,X92) )
& ( r2(X89,X90)
| ~ r2(X91,X92)
| ~ id(X89,X91)
| ~ id(X90,X92) )
& ( r2(X91,X92)
| ~ r2(X91,X92)
| ~ id(X89,X91)
| ~ id(X90,X92) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])])]) ).
fof(c_0_17,negated_conjecture,
! [X135] :
( ( id(X135,esk23_1(X135))
| r1(esk22_1(X135)) )
& ( r1(esk23_1(X135))
| r1(esk22_1(X135)) )
& ( id(X135,esk23_1(X135))
| r2(esk22_1(X135),esk21_1(X135)) )
& ( r1(esk23_1(X135))
| r2(esk22_1(X135),esk21_1(X135)) )
& ( id(X135,esk23_1(X135))
| id(X135,esk21_1(X135)) )
& ( r1(esk23_1(X135))
| id(X135,esk21_1(X135)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_18,plain,
! [X82,X83] :
( ~ id(X82,X83)
| id(X83,X82) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_19,plain,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_20,plain,
! [X84,X85,X86] :
( ~ id(X84,X85)
| id(X84,X86)
| ~ id(X85,X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
fof(c_0_21,plain,
! [X121] :
( id(esk13_1(X121),X121)
& r1(esk14_1(X121))
& r3(X121,esk14_1(X121),esk13_1(X121)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_22,plain,
! [X50,X51] :
( ! [X52] :
( ! [X53] :
( ~ id(X53,X52)
| ~ r2(X50,X53) )
| ~ r2(X51,X52) )
| id(X50,X51) ),
inference(fof_simplification,[status(thm)],[axiom_3a]) ).
cnf(c_0_23,plain,
( r2(X1,X2)
| ~ r2(X3,X4)
| ~ id(X3,X1)
| ~ id(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( id(X1,esk23_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( id(X2,X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( id(X1,esk23_1(X1))
| id(X1,esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_27,plain,
! [X69] :
( ( ~ r1(X69)
| id(X69,esk1_0) )
& ( ~ id(X69,esk1_0)
| id(X69,esk1_0) )
& ( ~ r1(X69)
| r1(X69) )
& ( ~ id(X69,esk1_0)
| r1(X69) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_28,negated_conjecture,
( r1(esk23_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( r1(esk23_1(X1))
| id(X1,esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_30,plain,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_31,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_32,plain,
( id(X1,X3)
| ~ id(X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
id(esk13_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X117,X118,X119,X120] :
( ~ id(X120,X119)
| ~ r2(X117,X120)
| ~ r2(X118,X119)
| id(X117,X118) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])])]) ).
fof(c_0_35,plain,
! [X111,X112] :
( id(esk10_2(X111,X112),esk9_2(X111,X112))
& r2(X112,esk11_2(X111,X112))
& r4(X111,esk11_2(X111,X112),esk10_2(X111,X112))
& r3(esk12_2(X111,X112),X111,esk9_2(X111,X112))
& r4(X111,X112,esk12_2(X111,X112)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])]) ).
fof(c_0_36,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_37,negated_conjecture,
( r2(X1,X2)
| id(X3,esk23_1(X3))
| ~ id(esk21_1(X3),X2)
| ~ id(esk22_1(X3),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( id(X1,esk23_1(X1))
| id(esk21_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_39,plain,
( id(X1,esk1_0)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( id(X1,esk23_1(X1))
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_41,negated_conjecture,
( r2(X1,X2)
| r1(esk23_1(X3))
| ~ id(esk21_1(X3),X2)
| ~ id(esk22_1(X3),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_42,negated_conjecture,
( r1(esk23_1(X1))
| id(esk21_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( r1(esk23_1(X1))
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_44,plain,
! [X132,X133,X134] :
( ~ id(X134,X133)
| ~ r1(X134)
| ~ r2(X132,X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])])]) ).
fof(c_0_45,plain,
! [X70,X72] :
( ( ~ r2(X70,X72)
| id(X72,esk2_1(X70)) )
& ( ~ id(X72,esk2_1(X70))
| id(X72,esk2_1(X70)) )
& ( ~ r2(X70,X72)
| r2(X70,X72) )
& ( ~ id(X72,esk2_1(X70))
| r2(X70,X72) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_31])])])]) ).
cnf(c_0_46,plain,
( id(X1,X2)
| ~ id(X1,esk13_1(X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_47,plain,
( id(X3,X4)
| ~ id(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_48,plain,
r2(X1,esk11_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_49,plain,
! [X87,X88] :
( ( r1(X87)
| ~ r1(X87)
| ~ id(X87,X88) )
& ( r1(X88)
| ~ r1(X87)
| ~ id(X87,X88) )
& ( r1(X87)
| ~ r1(X88)
| ~ id(X87,X88) )
& ( r1(X88)
| ~ r1(X88)
| ~ id(X87,X88) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_36])])]) ).
cnf(c_0_50,negated_conjecture,
( r2(X1,X2)
| id(X2,esk23_1(X2))
| ~ id(esk22_1(X2),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_51,negated_conjecture,
( id(esk22_1(X1),esk1_0)
| id(X1,esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( r2(X1,X2)
| r1(esk23_1(X2))
| ~ id(esk22_1(X2),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( r1(esk23_1(X1))
| id(esk22_1(X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_54,plain,
( ~ id(X1,X2)
| ~ r1(X1)
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_55,plain,
! [X124] :
( r1(esk16_1(X124))
& r4(X124,esk16_1(X124),esk15_1(X124))
& id(esk15_1(X124),esk17_1(X124))
& r1(esk17_1(X124)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
cnf(c_0_56,plain,
( r2(X2,X1)
| ~ id(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_57,plain,
id(esk13_1(esk13_1(X1)),X1),
inference(spm,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_58,plain,
( id(X1,X2)
| ~ r2(X1,X3)
| ~ id(X3,esk11_2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_59,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_60,negated_conjecture,
( r2(esk1_0,X1)
| id(X1,esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
( r2(esk1_0,X1)
| r1(esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( ~ r1(X1)
| ~ id(X1,esk11_2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_54,c_0_48]) ).
cnf(c_0_63,plain,
r1(esk16_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_64,plain,
r2(X1,esk13_1(esk13_1(esk2_1(X1)))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,plain,
( id(X1,X2)
| ~ r2(X1,esk13_1(esk13_1(esk11_2(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( r2(esk1_0,X1)
| r1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_67,plain,
~ r1(esk13_1(esk13_1(esk11_2(X1,X2)))),
inference(spm,[status(thm)],[c_0_62,c_0_57]) ).
cnf(c_0_68,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_69,plain,
id(esk16_1(X1),esk1_0),
inference(spm,[status(thm)],[c_0_39,c_0_63]) ).
cnf(c_0_70,plain,
( ~ r1(X1)
| ~ id(X1,esk13_1(esk13_1(esk2_1(X2)))) ),
inference(spm,[status(thm)],[c_0_54,c_0_64]) ).
cnf(c_0_71,negated_conjecture,
id(esk1_0,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_72,plain,
r1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_63])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUN068+1 : TPTP v8.1.2. Released v7.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n005.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 11:58:10 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.I5qBxe5fba/E---3.1_30914.p
% 11.56/1.87 # Version: 3.1.0
% 11.56/1.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.56/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.56/1.87 # Starting new_bool_3 with 300s (1) cores
% 11.56/1.87 # Starting new_bool_1 with 300s (1) cores
% 11.56/1.87 # Starting sh5l with 300s (1) cores
% 11.56/1.87 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30992 completed with status 0
% 11.56/1.87 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.56/1.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.56/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.56/1.87 # No SInE strategy applied
% 11.56/1.87 # Search class: FGHNM-FFMF21-SFFFFFNN
% 11.56/1.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.56/1.87 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 694s (1) cores
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.56/1.87 # Starting new_bool_3 with 211s (1) cores
% 11.56/1.87 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 11.56/1.87 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 31003 completed with status 0
% 11.56/1.87 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 11.56/1.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.56/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.56/1.87 # No SInE strategy applied
% 11.56/1.87 # Search class: FGHNM-FFMF21-SFFFFFNN
% 11.56/1.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.56/1.87 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 694s (1) cores
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.56/1.87 # Starting new_bool_3 with 211s (1) cores
% 11.56/1.87 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 11.56/1.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 11.56/1.87 # Preprocessing time : 0.001 s
% 11.56/1.87 # Presaturation interreduction done
% 11.56/1.87
% 11.56/1.87 # Proof found!
% 11.56/1.87 # SZS status Theorem
% 11.56/1.87 # SZS output start CNFRefutation
% See solution above
% 11.56/1.87 # Parsed axioms : 19
% 11.56/1.87 # Removed by relevancy pruning/SinE : 0
% 11.56/1.87 # Initial clauses : 64
% 11.56/1.87 # Removed in clause preprocessing : 16
% 11.56/1.87 # Initial clauses in saturation : 48
% 11.56/1.87 # Processed clauses : 13889
% 11.56/1.87 # ...of these trivial : 962
% 11.56/1.87 # ...subsumed : 10521
% 11.56/1.87 # ...remaining for further processing : 2406
% 11.56/1.87 # Other redundant clauses eliminated : 0
% 11.56/1.87 # Clauses deleted for lack of memory : 0
% 11.56/1.87 # Backward-subsumed : 32
% 11.56/1.87 # Backward-rewritten : 219
% 11.56/1.87 # Generated clauses : 135369
% 11.56/1.87 # ...of the previous two non-redundant : 106173
% 11.56/1.87 # ...aggressively subsumed : 0
% 11.56/1.87 # Contextual simplify-reflections : 51
% 11.56/1.87 # Paramodulations : 135369
% 11.56/1.87 # Factorizations : 0
% 11.56/1.87 # NegExts : 0
% 11.56/1.87 # Equation resolutions : 0
% 11.56/1.87 # Disequality decompositions : 0
% 11.56/1.87 # Total rewrite steps : 61876
% 11.56/1.87 # ...of those cached : 60740
% 11.56/1.87 # Propositional unsat checks : 0
% 11.56/1.87 # Propositional check models : 0
% 11.56/1.87 # Propositional check unsatisfiable : 0
% 11.56/1.87 # Propositional clauses : 0
% 11.56/1.87 # Propositional clauses after purity: 0
% 11.56/1.87 # Propositional unsat core size : 0
% 11.56/1.87 # Propositional preprocessing time : 0.000
% 11.56/1.87 # Propositional encoding time : 0.000
% 11.56/1.87 # Propositional solver time : 0.000
% 11.56/1.87 # Success case prop preproc time : 0.000
% 11.56/1.87 # Success case prop encoding time : 0.000
% 11.56/1.87 # Success case prop solver time : 0.000
% 11.56/1.87 # Current number of processed clauses : 2107
% 11.56/1.87 # Positive orientable unit clauses : 659
% 11.56/1.87 # Positive unorientable unit clauses: 0
% 11.56/1.87 # Negative unit clauses : 126
% 11.56/1.87 # Non-unit-clauses : 1322
% 11.56/1.87 # Current number of unprocessed clauses: 88171
% 11.56/1.87 # ...number of literals in the above : 180620
% 11.56/1.87 # Current number of archived formulas : 0
% 11.56/1.87 # Current number of archived clauses : 299
% 11.56/1.87 # Clause-clause subsumption calls (NU) : 321911
% 11.56/1.87 # Rec. Clause-clause subsumption calls : 275345
% 11.56/1.87 # Non-unit clause-clause subsumptions : 9317
% 11.56/1.87 # Unit Clause-clause subsumption calls : 9928
% 11.56/1.87 # Rewrite failures with RHS unbound : 0
% 11.56/1.87 # BW rewrite match attempts : 7104
% 11.56/1.87 # BW rewrite match successes : 192
% 11.56/1.87 # Condensation attempts : 0
% 11.56/1.87 # Condensation successes : 0
% 11.56/1.87 # Termbank termtop insertions : 1612436
% 11.56/1.87 # Search garbage collected termcells : 404
% 11.56/1.87
% 11.56/1.87 # -------------------------------------------------
% 11.56/1.87 # User time : 1.353 s
% 11.56/1.87 # System time : 0.047 s
% 11.56/1.87 # Total time : 1.399 s
% 11.56/1.87 # Maximum resident set size: 1912 pages
% 11.56/1.87
% 11.56/1.87 # -------------------------------------------------
% 11.56/1.87 # User time : 6.809 s
% 11.56/1.87 # System time : 0.222 s
% 11.56/1.87 # Total time : 7.031 s
% 11.56/1.87 # Maximum resident set size: 1760 pages
% 11.56/1.87 % E---3.1 exiting
% 11.56/1.87 % E exiting
%------------------------------------------------------------------------------