TSTP Solution File: SEU406+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU406+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:31:59 EDT 2023
% Result : Theorem 11.49s 3.38s
% Output : CNFRefutation 11.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 11 unt; 0 def)
% Number of atoms : 169 ( 26 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 209 ( 96 ~; 58 |; 45 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 88 ( 0 sgn; 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t70_xboole_1,axiom,
! [X1,X2,X3] :
( ~ ( ~ r1_xboole_0(X1,k2_xboole_0(X2,X3))
& r1_xboole_0(X1,X2)
& r1_xboole_0(X1,X3) )
& ~ ( ~ ( r1_xboole_0(X1,X2)
& r1_xboole_0(X1,X3) )
& r1_xboole_0(X1,k2_xboole_0(X2,X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t70_xboole_1) ).
fof(t1_latsum_1,conjecture,
! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t1_latsum_1) ).
fof(t54_zfmisc_1,axiom,
! [X1,X2] :
~ ( r1_xboole_0(k1_tarski(X1),X2)
& r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t54_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',commutativity_k2_xboole_0) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( r1_xboole_0(X1,X2)
=> r1_xboole_0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',symmetry_r1_xboole_0) ).
fof(t83_xboole_1,axiom,
! [X1,X2] :
( r1_xboole_0(X1,X2)
<=> k4_xboole_0(X1,X2) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t83_xboole_1) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
& ~ r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',d4_xboole_0) ).
fof(t56_zfmisc_1,axiom,
! [X1,X2] :
( ~ r2_hidden(X1,X2)
=> r1_xboole_0(k1_tarski(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t56_zfmisc_1) ).
fof(t65_zfmisc_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,k1_tarski(X2)) = X1
<=> ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p',t65_zfmisc_1) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( ~ ( ~ r1_xboole_0(X1,k2_xboole_0(X2,X3))
& r1_xboole_0(X1,X2)
& r1_xboole_0(X1,X3) )
& ~ ( ~ ( r1_xboole_0(X1,X2)
& r1_xboole_0(X1,X3) )
& r1_xboole_0(X1,k2_xboole_0(X2,X3)) ) ),
inference(fof_simplification,[status(thm)],[t70_xboole_1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
inference(assume_negation,[status(cth)],[t1_latsum_1]) ).
fof(c_0_11,plain,
! [X678,X679] :
( ~ r1_xboole_0(k1_tarski(X678),X679)
| ~ r2_hidden(X678,X679) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_zfmisc_1])]) ).
fof(c_0_12,plain,
! [X643,X644,X645] :
( ( r1_xboole_0(X643,k2_xboole_0(X644,X645))
| ~ r1_xboole_0(X643,X644)
| ~ r1_xboole_0(X643,X645) )
& ( r1_xboole_0(X643,X644)
| ~ r1_xboole_0(X643,k2_xboole_0(X644,X645)) )
& ( r1_xboole_0(X643,X645)
| ~ r1_xboole_0(X643,k2_xboole_0(X644,X645)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,negated_conjecture,
( r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0))
& r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0))
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X249,X250] : k2_xboole_0(X249,X250) = k2_xboole_0(X250,X249),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_15,plain,
( ~ r1_xboole_0(k1_tarski(X1),X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( r1_xboole_0(X1,k2_xboole_0(X2,X3))
| ~ r1_xboole_0(X1,X2)
| ~ r1_xboole_0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X624,X625] :
( ~ r1_xboole_0(X624,X625)
| r1_xboole_0(X625,X624) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_20,plain,
! [X153,X154] :
( ( ~ r1_xboole_0(X153,X154)
| k4_xboole_0(X153,X154) = X153 )
& ( k4_xboole_0(X153,X154) != X153
| r1_xboole_0(X153,X154) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).
fof(c_0_21,plain,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
& ~ r2_hidden(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
cnf(c_0_22,plain,
( ~ r1_xboole_0(k1_tarski(X1),X2)
| ~ r1_xboole_0(k1_tarski(X1),X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( r1_xboole_0(X2,X1)
| ~ r1_xboole_0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( r1_xboole_0(X1,X2)
| k4_xboole_0(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X1,X2] :
( ~ r2_hidden(X1,X2)
=> r1_xboole_0(k1_tarski(X1),X2) ),
inference(fof_simplification,[status(thm)],[t56_zfmisc_1]) ).
fof(c_0_27,plain,
! [X71,X72,X73,X74,X75,X76,X77,X78] :
( ( r2_hidden(X74,X71)
| ~ r2_hidden(X74,X73)
| X73 != k4_xboole_0(X71,X72) )
& ( ~ r2_hidden(X74,X72)
| ~ r2_hidden(X74,X73)
| X73 != k4_xboole_0(X71,X72) )
& ( ~ r2_hidden(X75,X71)
| r2_hidden(X75,X72)
| r2_hidden(X75,X73)
| X73 != k4_xboole_0(X71,X72) )
& ( ~ r2_hidden(esk10_3(X76,X77,X78),X78)
| ~ r2_hidden(esk10_3(X76,X77,X78),X76)
| r2_hidden(esk10_3(X76,X77,X78),X77)
| X78 = k4_xboole_0(X76,X77) )
& ( r2_hidden(esk10_3(X76,X77,X78),X76)
| r2_hidden(esk10_3(X76,X77,X78),X78)
| X78 = k4_xboole_0(X76,X77) )
& ( ~ r2_hidden(esk10_3(X76,X77,X78),X77)
| r2_hidden(esk10_3(X76,X77,X78),X78)
| X78 = k4_xboole_0(X76,X77) ) ),
inference(distribute,[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_21])])])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ r1_xboole_0(k1_tarski(esk2_0),esk3_0)
| ~ r1_xboole_0(k1_tarski(esk2_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( r1_xboole_0(X1,X2)
| k4_xboole_0(X2,X1) != X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X680,X681] :
( r2_hidden(X680,X681)
| r1_xboole_0(k1_tarski(X680),X681) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
fof(c_0_31,plain,
! [X1,X2] :
( k4_xboole_0(X1,k1_tarski(X2)) = X1
<=> ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
cnf(c_0_32,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,plain,
( r2_hidden(X1,X3)
| r2_hidden(X1,X4)
| ~ r2_hidden(X1,X2)
| X4 != k4_xboole_0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( k4_xboole_0(esk3_0,k1_tarski(esk2_0)) != esk3_0
| ~ r1_xboole_0(k1_tarski(esk2_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( r2_hidden(X1,X2)
| r1_xboole_0(k1_tarski(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_36,plain,
! [X192,X193] :
( ( k4_xboole_0(X192,k1_tarski(X193)) != X192
| ~ r2_hidden(X193,X192) )
& ( r2_hidden(X193,X192)
| k4_xboole_0(X192,k1_tarski(X193)) = X192 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_38,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( r2_hidden(esk2_0,esk4_0)
| k4_xboole_0(esk3_0,k1_tarski(esk2_0)) != esk3_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( r2_hidden(X1,X2)
| k4_xboole_0(X2,k1_tarski(X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
( ~ r1_xboole_0(k1_tarski(esk1_0),esk3_0)
| ~ r1_xboole_0(k1_tarski(esk1_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( r2_hidden(esk2_0,esk3_0)
| r2_hidden(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( k4_xboole_0(esk3_0,k1_tarski(esk1_0)) != esk3_0
| ~ r1_xboole_0(k1_tarski(esk1_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_50,negated_conjecture,
~ r2_hidden(esk1_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_40]) ).
cnf(c_0_51,negated_conjecture,
( ~ r2_hidden(esk2_0,esk3_0)
| ~ r2_hidden(esk1_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_39]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_40]) ).
cnf(c_0_53,negated_conjecture,
k4_xboole_0(esk3_0,k1_tarski(esk1_0)) != esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
~ r2_hidden(esk1_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_47]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU406+3 : TPTP v8.1.2. Released v3.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 08:36:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.39/1.63 Running first-order model finding
% 1.39/1.63 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.i20K5tBvjJ/E---3.1_10478.p
% 11.49/3.38 # Version: 3.1pre001
% 11.49/3.38 # Preprocessing class: FMLLSMLLSSSNFFN.
% 11.49/3.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.49/3.38 # Starting new_bool_3 with 900s (3) cores
% 11.49/3.38 # Starting new_bool_1 with 900s (3) cores
% 11.49/3.38 # Starting sh5l with 300s (1) cores
% 11.49/3.38 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 11.49/3.38 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 10659 completed with status 0
% 11.49/3.38 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 11.49/3.38 # Preprocessing class: FMLLSMLLSSSNFFN.
% 11.49/3.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.49/3.38 # Starting new_bool_3 with 900s (3) cores
% 11.49/3.38 # Starting new_bool_1 with 900s (3) cores
% 11.49/3.38 # Starting sh5l with 300s (1) cores
% 11.49/3.38 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 11.49/3.38 # SinE strategy is gf120_gu_R02_F100_L20000
% 11.49/3.38 # Search class: FGHSM-FSLM32-MFFFFFNN
% 11.49/3.38 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 11.49/3.38 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 11.49/3.38 # G-E--_303_C18_F1_URBAN_S0Y with pid 10666 completed with status 0
% 11.49/3.38 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 11.49/3.38 # Preprocessing class: FMLLSMLLSSSNFFN.
% 11.49/3.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.49/3.38 # Starting new_bool_3 with 900s (3) cores
% 11.49/3.38 # Starting new_bool_1 with 900s (3) cores
% 11.49/3.38 # Starting sh5l with 300s (1) cores
% 11.49/3.38 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 11.49/3.38 # SinE strategy is gf120_gu_R02_F100_L20000
% 11.49/3.38 # Search class: FGHSM-FSLM32-MFFFFFNN
% 11.49/3.38 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 11.49/3.38 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 11.49/3.38 # Preprocessing time : 0.031 s
% 11.49/3.38
% 11.49/3.38 # Proof found!
% 11.49/3.38 # SZS status Theorem
% 11.49/3.38 # SZS output start CNFRefutation
% See solution above
% 11.49/3.38 # Parsed axioms : 19023
% 11.49/3.38 # Removed by relevancy pruning/SinE : 18608
% 11.49/3.38 # Initial clauses : 717
% 11.49/3.38 # Removed in clause preprocessing : 22
% 11.49/3.38 # Initial clauses in saturation : 695
% 11.49/3.38 # Processed clauses : 3889
% 11.49/3.38 # ...of these trivial : 93
% 11.49/3.38 # ...subsumed : 1943
% 11.49/3.38 # ...remaining for further processing : 1853
% 11.49/3.38 # Other redundant clauses eliminated : 158
% 11.49/3.38 # Clauses deleted for lack of memory : 0
% 11.49/3.38 # Backward-subsumed : 216
% 11.49/3.38 # Backward-rewritten : 67
% 11.49/3.38 # Generated clauses : 50286
% 11.49/3.38 # ...of the previous two non-redundant : 45722
% 11.49/3.38 # ...aggressively subsumed : 0
% 11.49/3.38 # Contextual simplify-reflections : 108
% 11.49/3.38 # Paramodulations : 50053
% 11.49/3.38 # Factorizations : 15
% 11.49/3.38 # NegExts : 0
% 11.49/3.38 # Equation resolutions : 219
% 11.49/3.38 # Total rewrite steps : 15757
% 11.49/3.38 # Propositional unsat checks : 0
% 11.49/3.38 # Propositional check models : 0
% 11.49/3.38 # Propositional check unsatisfiable : 0
% 11.49/3.38 # Propositional clauses : 0
% 11.49/3.38 # Propositional clauses after purity: 0
% 11.49/3.38 # Propositional unsat core size : 0
% 11.49/3.38 # Propositional preprocessing time : 0.000
% 11.49/3.38 # Propositional encoding time : 0.000
% 11.49/3.38 # Propositional solver time : 0.000
% 11.49/3.38 # Success case prop preproc time : 0.000
% 11.49/3.38 # Success case prop encoding time : 0.000
% 11.49/3.38 # Success case prop solver time : 0.000
% 11.49/3.38 # Current number of processed clauses : 1560
% 11.49/3.38 # Positive orientable unit clauses : 124
% 11.49/3.38 # Positive unorientable unit clauses: 6
% 11.49/3.38 # Negative unit clauses : 128
% 11.49/3.38 # Non-unit-clauses : 1302
% 11.49/3.38 # Current number of unprocessed clauses: 42217
% 11.49/3.38 # ...number of literals in the above : 151340
% 11.49/3.38 # Current number of archived formulas : 0
% 11.49/3.38 # Current number of archived clauses : 284
% 11.49/3.38 # Clause-clause subsumption calls (NU) : 492622
% 11.49/3.38 # Rec. Clause-clause subsumption calls : 212469
% 11.49/3.38 # Non-unit clause-clause subsumptions : 1361
% 11.49/3.38 # Unit Clause-clause subsumption calls : 27022
% 11.49/3.38 # Rewrite failures with RHS unbound : 0
% 11.49/3.38 # BW rewrite match attempts : 311
% 11.49/3.38 # BW rewrite match successes : 146
% 11.49/3.38 # Condensation attempts : 0
% 11.49/3.38 # Condensation successes : 0
% 11.49/3.38 # Termbank termtop insertions : 1177027
% 11.49/3.38
% 11.49/3.38 # -------------------------------------------------
% 11.49/3.38 # User time : 1.208 s
% 11.49/3.38 # System time : 0.078 s
% 11.49/3.38 # Total time : 1.286 s
% 11.49/3.38 # Maximum resident set size: 38548 pages
% 11.49/3.38
% 11.49/3.38 # -------------------------------------------------
% 11.49/3.38 # User time : 1.595 s
% 11.49/3.38 # System time : 0.098 s
% 11.49/3.38 # Total time : 1.692 s
% 11.49/3.38 # Maximum resident set size: 29624 pages
% 11.49/3.38 % E---3.1 exiting
%------------------------------------------------------------------------------