TSTP Solution File: SEU214+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU214+3 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Tue May 21 03:25:58 EDT 2024
% Result : Theorem 1.14s 0.54s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 233 ( 47 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 304 ( 121 ~; 126 |; 31 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-5 aty)
% Number of variables : 99 ( 2 sgn 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
fof(t22_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
=> apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_funct_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X1)
& relation(X2) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_relat_1) ).
fof(fc1_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& relation(X2)
& function(X2) )
=> ( relation(relation_composition(X1,X2))
& function(relation_composition(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_funct_1) ).
fof(d8_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( relation(X3)
=> ( X3 = relation_composition(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ? [X6] :
( in(ordered_pair(X4,X6),X1)
& in(ordered_pair(X6,X5),X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_1) ).
fof(c_0_6,plain,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
inference(fof_simplification,[status(thm)],[d4_funct_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
=> apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
inference(assume_negation,[status(cth)],[t22_funct_1]) ).
fof(c_0_8,plain,
! [X10,X11,X12] :
( ( X12 != apply(X10,X11)
| in(ordered_pair(X11,X12),X10)
| ~ in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( ~ in(ordered_pair(X11,X12),X10)
| X12 = apply(X10,X11)
| ~ in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( X12 != apply(X10,X11)
| X12 = empty_set
| in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( X12 != empty_set
| X12 = apply(X10,X11)
| in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& relation(esk3_0)
& function(esk3_0)
& in(esk1_0,relation_dom(relation_composition(esk3_0,esk2_0)))
& apply(relation_composition(esk3_0,esk2_0),esk1_0) != apply(esk2_0,apply(esk3_0,esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X42,X43,X44,X46,X47,X48,X50] :
( ( ~ in(X44,X43)
| in(ordered_pair(X44,esk8_3(X42,X43,X44)),X42)
| X43 != relation_dom(X42)
| ~ relation(X42) )
& ( ~ in(ordered_pair(X46,X47),X42)
| in(X46,X43)
| X43 != relation_dom(X42)
| ~ relation(X42) )
& ( ~ in(esk9_2(X42,X48),X48)
| ~ in(ordered_pair(esk9_2(X42,X48),X50),X42)
| X48 = relation_dom(X42)
| ~ relation(X42) )
& ( in(esk9_2(X42,X48),X48)
| in(ordered_pair(esk9_2(X42,X48),esk10_2(X42,X48)),X42)
| X48 = relation_dom(X42)
| ~ relation(X42) ) ),
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)],[d4_relat_1])])])])])])]) ).
cnf(c_0_11,plain,
( X2 = apply(X3,X1)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(X1,relation_dom(X3))
| ~ relation(X3)
| ~ function(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,relation_dom(relation_composition(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X26,X27] :
( ~ relation(X26)
| ~ relation(X27)
| relation(relation_composition(X26,X27)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])])]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X1,esk8_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( X1 = apply(relation_composition(esk3_0,esk2_0),esk1_0)
| ~ relation(relation_composition(esk3_0,esk2_0))
| ~ function(relation_composition(esk3_0,esk2_0))
| ~ in(ordered_pair(esk1_0,X1),relation_composition(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X30,X31] :
( ( relation(relation_composition(X30,X31))
| ~ relation(X30)
| ~ function(X30)
| ~ relation(X31)
| ~ function(X31) )
& ( function(relation_composition(X30,X31))
| ~ relation(X30)
| ~ function(X30)
| ~ relation(X31)
| ~ function(X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_funct_1])])])]) ).
cnf(c_0_20,plain,
( in(ordered_pair(X1,esk8_3(X2,relation_dom(X2),X1)),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X13,X14,X15,X16,X17,X19,X20,X21,X24] :
( ( in(ordered_pair(X16,esk4_5(X13,X14,X15,X16,X17)),X13)
| ~ in(ordered_pair(X16,X17),X15)
| X15 != relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) )
& ( in(ordered_pair(esk4_5(X13,X14,X15,X16,X17),X17),X14)
| ~ in(ordered_pair(X16,X17),X15)
| X15 != relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) )
& ( ~ in(ordered_pair(X19,X21),X13)
| ~ in(ordered_pair(X21,X20),X14)
| in(ordered_pair(X19,X20),X15)
| X15 != relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) )
& ( ~ in(ordered_pair(esk5_3(X13,X14,X15),esk6_3(X13,X14,X15)),X15)
| ~ in(ordered_pair(esk5_3(X13,X14,X15),X24),X13)
| ~ in(ordered_pair(X24,esk6_3(X13,X14,X15)),X14)
| X15 = relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) )
& ( in(ordered_pair(esk5_3(X13,X14,X15),esk7_3(X13,X14,X15)),X13)
| in(ordered_pair(esk5_3(X13,X14,X15),esk6_3(X13,X14,X15)),X15)
| X15 = relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) )
& ( in(ordered_pair(esk7_3(X13,X14,X15),esk6_3(X13,X14,X15)),X14)
| in(ordered_pair(esk5_3(X13,X14,X15),esk6_3(X13,X14,X15)),X15)
| X15 = relation_composition(X13,X14)
| ~ relation(X15)
| ~ relation(X14)
| ~ relation(X13) ) ),
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)],[d8_relat_1])])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( X1 = apply(relation_composition(esk3_0,esk2_0),esk1_0)
| ~ function(relation_composition(esk3_0,esk2_0))
| ~ in(ordered_pair(esk1_0,X1),relation_composition(esk3_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_23,plain,
( function(relation_composition(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( in(ordered_pair(esk1_0,esk8_3(relation_composition(esk3_0,esk2_0),relation_dom(relation_composition(esk3_0,esk2_0)),esk1_0)),relation_composition(esk3_0,esk2_0))
| ~ relation(relation_composition(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_27,plain,
( in(ordered_pair(X1,esk4_5(X2,X3,X4,X1,X5)),X2)
| ~ in(ordered_pair(X1,X5),X4)
| X4 != relation_composition(X2,X3)
| ~ relation(X4)
| ~ relation(X3)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( X1 = apply(relation_composition(esk3_0,esk2_0),esk1_0)
| ~ in(ordered_pair(esk1_0,X1),relation_composition(esk3_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_18]),c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
in(ordered_pair(esk1_0,esk8_3(relation_composition(esk3_0,esk2_0),relation_dom(relation_composition(esk3_0,esk2_0)),esk1_0)),relation_composition(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_30,plain,
( in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( in(ordered_pair(X1,esk4_5(X2,X3,relation_composition(X2,X3),X1,X4)),X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(ordered_pair(X1,X4),relation_composition(X2,X3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_16]) ).
cnf(c_0_32,negated_conjecture,
esk8_3(relation_composition(esk3_0,esk2_0),relation_dom(relation_composition(esk3_0,esk2_0)),esk1_0) = apply(relation_composition(esk3_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(ordered_pair(X1,X3),X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
in(ordered_pair(esk1_0,esk4_5(esk3_0,esk2_0,relation_composition(esk3_0,esk2_0),esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0))),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_32]),c_0_17]),c_0_18])]) ).
cnf(c_0_35,negated_conjecture,
in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_18])]) ).
cnf(c_0_36,plain,
( in(ordered_pair(esk4_5(X1,X2,X3,X4,X5),X5),X2)
| ~ in(ordered_pair(X4,X5),X3)
| X3 != relation_composition(X1,X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_37,negated_conjecture,
( X1 = apply(esk3_0,esk1_0)
| ~ in(ordered_pair(esk1_0,X1),esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_35]),c_0_18]),c_0_25])]) ).
cnf(c_0_38,plain,
( X1 = apply(X2,X3)
| in(X3,relation_dom(X2))
| X1 != empty_set
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,plain,
( in(ordered_pair(esk4_5(X1,X2,relation_composition(X1,X2),X3,X4),X4),X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(ordered_pair(X3,X4),relation_composition(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_16]) ).
cnf(c_0_40,negated_conjecture,
esk4_5(esk3_0,esk2_0,relation_composition(esk3_0,esk2_0),esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0)) = apply(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_41,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
in(ordered_pair(apply(esk3_0,esk1_0),apply(relation_composition(esk3_0,esk2_0),esk1_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_32]),c_0_40]),c_0_32]),c_0_17]),c_0_18])]) ).
cnf(c_0_43,plain,
( apply(X1,X2) = empty_set
| X3 = apply(X1,X2)
| ~ relation(X1)
| ~ function(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
apply(relation_composition(esk3_0,esk2_0),esk1_0) != apply(esk2_0,apply(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
in(apply(esk3_0,esk1_0),relation_dom(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_42]),c_0_17])]) ).
cnf(c_0_46,negated_conjecture,
apply(esk2_0,apply(esk3_0,esk1_0)) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_17]),c_0_24])]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( X1 = empty_set
| ~ in(ordered_pair(apply(esk3_0,esk1_0),X1),esk2_0) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_45]),c_0_17]),c_0_24])]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
apply(relation_composition(esk3_0,esk2_0),esk1_0) != empty_set,
inference(rw,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU214+3 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n020.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 16:53:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 1.14/0.54 # Version: 3.1.0
% 1.14/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.14/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.14/0.54 # Starting sh5l with 300s (1) cores
% 1.14/0.54 # new_bool_1 with pid 15445 completed with status 0
% 1.14/0.54 # Result found by new_bool_1
% 1.14/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.14/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.14/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.14/0.54 # Search class: FGHSS-FFMM32-SFFFFFNN
% 1.14/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.14/0.54 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 181s (1) cores
% 1.14/0.54 # G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 15454 completed with status 0
% 1.14/0.54 # Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 1.14/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.14/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.14/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.14/0.54 # Search class: FGHSS-FFMM32-SFFFFFNN
% 1.14/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.14/0.54 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 181s (1) cores
% 1.14/0.54 # Preprocessing time : 0.001 s
% 1.14/0.54 # Presaturation interreduction done
% 1.14/0.54
% 1.14/0.54 # Proof found!
% 1.14/0.54 # SZS status Theorem
% 1.14/0.54 # SZS output start CNFRefutation
% See solution above
% 1.14/0.54 # Parsed axioms : 40
% 1.14/0.54 # Removed by relevancy pruning/SinE : 8
% 1.14/0.54 # Initial clauses : 58
% 1.14/0.54 # Removed in clause preprocessing : 0
% 1.14/0.54 # Initial clauses in saturation : 58
% 1.14/0.54 # Processed clauses : 2004
% 1.14/0.54 # ...of these trivial : 7
% 1.14/0.54 # ...subsumed : 1610
% 1.14/0.54 # ...remaining for further processing : 387
% 1.14/0.54 # Other redundant clauses eliminated : 0
% 1.14/0.54 # Clauses deleted for lack of memory : 0
% 1.14/0.54 # Backward-subsumed : 54
% 1.14/0.54 # Backward-rewritten : 14
% 1.14/0.54 # Generated clauses : 5787
% 1.14/0.54 # ...of the previous two non-redundant : 5644
% 1.14/0.54 # ...aggressively subsumed : 0
% 1.14/0.54 # Contextual simplify-reflections : 44
% 1.14/0.54 # Paramodulations : 5757
% 1.14/0.54 # Factorizations : 4
% 1.14/0.54 # NegExts : 0
% 1.14/0.54 # Equation resolutions : 26
% 1.14/0.54 # Disequality decompositions : 0
% 1.14/0.54 # Total rewrite steps : 1098
% 1.14/0.54 # ...of those cached : 1068
% 1.14/0.54 # Propositional unsat checks : 0
% 1.14/0.54 # Propositional check models : 0
% 1.14/0.54 # Propositional check unsatisfiable : 0
% 1.14/0.54 # Propositional clauses : 0
% 1.14/0.54 # Propositional clauses after purity: 0
% 1.14/0.54 # Propositional unsat core size : 0
% 1.14/0.54 # Propositional preprocessing time : 0.000
% 1.14/0.54 # Propositional encoding time : 0.000
% 1.14/0.54 # Propositional solver time : 0.000
% 1.14/0.54 # Success case prop preproc time : 0.000
% 1.14/0.54 # Success case prop encoding time : 0.000
% 1.14/0.54 # Success case prop solver time : 0.000
% 1.14/0.54 # Current number of processed clauses : 263
% 1.14/0.54 # Positive orientable unit clauses : 34
% 1.14/0.54 # Positive unorientable unit clauses: 0
% 1.14/0.54 # Negative unit clauses : 21
% 1.14/0.54 # Non-unit-clauses : 208
% 1.14/0.54 # Current number of unprocessed clauses: 3685
% 1.14/0.54 # ...number of literals in the above : 23898
% 1.14/0.54 # Current number of archived formulas : 0
% 1.14/0.54 # Current number of archived clauses : 124
% 1.14/0.54 # Clause-clause subsumption calls (NU) : 36267
% 1.14/0.54 # Rec. Clause-clause subsumption calls : 7748
% 1.14/0.54 # Non-unit clause-clause subsumptions : 976
% 1.14/0.54 # Unit Clause-clause subsumption calls : 428
% 1.14/0.54 # Rewrite failures with RHS unbound : 0
% 1.14/0.54 # BW rewrite match attempts : 6
% 1.14/0.54 # BW rewrite match successes : 6
% 1.14/0.54 # Condensation attempts : 0
% 1.14/0.54 # Condensation successes : 0
% 1.14/0.54 # Termbank termtop insertions : 89777
% 1.14/0.54 # Search garbage collected termcells : 930
% 1.14/0.54
% 1.14/0.54 # -------------------------------------------------
% 1.14/0.54 # User time : 0.134 s
% 1.14/0.54 # System time : 0.003 s
% 1.14/0.54 # Total time : 0.137 s
% 1.14/0.54 # Maximum resident set size: 1860 pages
% 1.14/0.54
% 1.14/0.54 # -------------------------------------------------
% 1.14/0.54 # User time : 0.135 s
% 1.14/0.54 # System time : 0.004 s
% 1.14/0.54 # Total time : 0.139 s
% 1.14/0.54 # Maximum resident set size: 1748 pages
% 1.14/0.54 % E---3.1 exiting
% 1.14/0.54 % E exiting
%------------------------------------------------------------------------------