TSTP Solution File: SEU439+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU439+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:26:33 EDT 2023
% Result : Theorem 96.43s 12.67s
% Output : CNFRefutation 96.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 13 unt; 0 def)
% Number of atoms : 165 ( 22 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 186 ( 70 ~; 84 |; 12 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 5 con; 0-4 aty)
% Number of variables : 126 ( 2 sgn; 65 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t24_relset_2,axiom,
! [X1,X2,X3,X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( r2_hidden(X3,k8_relset_2(X1,X2,X4,X5))
=> ! [X6] :
( r2_hidden(X6,X4)
=> r2_hidden(X3,k9_relat_1(X5,k1_tarski(X6))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',t24_relset_2) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',d3_tarski) ).
fof(t43_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( X3 != k1_xboole_0
=> r1_tarski(k8_relset_2(X1,X2,X3,X4),k9_relat_1(X4,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',t43_relset_2) ).
fof(d13_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2,X3] :
( X3 = k9_relat_1(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ? [X5] :
( r2_hidden(k4_tarski(X5,X4),X1)
& r2_hidden(X5,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',d13_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',d5_tarski) ).
fof(t9_relset_2,axiom,
! [X1,X2,X3] :
( v1_relat_1(X3)
=> ( r2_hidden(X1,k9_relat_1(X3,k1_tarski(X2)))
<=> r2_hidden(k4_tarski(X2,X1),X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',t9_relset_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',existence_m1_subset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> v1_relat_1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',cc1_relset_1) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/tmp.zAI8SMmRrF/E---3.1_23396.p',t6_boole) ).
fof(c_0_10,plain,
! [X113,X114,X115,X116,X117,X118] :
( ~ m1_subset_1(X116,k1_zfmisc_1(X113))
| ~ m1_subset_1(X117,k1_zfmisc_1(k2_zfmisc_1(X113,X114)))
| ~ r2_hidden(X115,k8_relset_2(X113,X114,X116,X117))
| ~ r2_hidden(X118,X116)
| r2_hidden(X115,k9_relat_1(X117,k1_tarski(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_relset_2])])]) ).
fof(c_0_11,plain,
! [X35,X36,X37,X38,X39] :
( ( ~ r1_tarski(X35,X36)
| ~ r2_hidden(X37,X35)
| r2_hidden(X37,X36) )
& ( r2_hidden(esk9_2(X38,X39),X38)
| r1_tarski(X38,X39) )
& ( ~ r2_hidden(esk9_2(X38,X39),X39)
| r1_tarski(X38,X39) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( X3 != k1_xboole_0
=> r1_tarski(k8_relset_2(X1,X2,X3,X4),k9_relat_1(X4,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t43_relset_2]) ).
cnf(c_0_13,plain,
( r2_hidden(X5,k9_relat_1(X3,k1_tarski(X6)))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4)))
| ~ r2_hidden(X5,k8_relset_2(X2,X4,X1,X3))
| ~ r2_hidden(X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( r2_hidden(esk9_2(X1,X2),X1)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
& esk3_0 != k1_xboole_0
& ~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X19,X20,X21,X22,X24,X25,X26,X27,X29] :
( ( r2_hidden(k4_tarski(esk5_4(X19,X20,X21,X22),X22),X19)
| ~ r2_hidden(X22,X21)
| X21 != k9_relat_1(X19,X20)
| ~ v1_relat_1(X19) )
& ( r2_hidden(esk5_4(X19,X20,X21,X22),X20)
| ~ r2_hidden(X22,X21)
| X21 != k9_relat_1(X19,X20)
| ~ v1_relat_1(X19) )
& ( ~ r2_hidden(k4_tarski(X25,X24),X19)
| ~ r2_hidden(X25,X20)
| r2_hidden(X24,X21)
| X21 != k9_relat_1(X19,X20)
| ~ v1_relat_1(X19) )
& ( ~ r2_hidden(esk6_3(X19,X26,X27),X27)
| ~ r2_hidden(k4_tarski(X29,esk6_3(X19,X26,X27)),X19)
| ~ r2_hidden(X29,X26)
| X27 = k9_relat_1(X19,X26)
| ~ v1_relat_1(X19) )
& ( r2_hidden(k4_tarski(esk7_3(X19,X26,X27),esk6_3(X19,X26,X27)),X19)
| r2_hidden(esk6_3(X19,X26,X27),X27)
| X27 = k9_relat_1(X19,X26)
| ~ v1_relat_1(X19) )
& ( r2_hidden(esk7_3(X19,X26,X27),X26)
| r2_hidden(esk6_3(X19,X26,X27),X27)
| X27 = k9_relat_1(X19,X26)
| ~ v1_relat_1(X19) ) ),
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)],[d13_relat_1])])])])])]) ).
fof(c_0_17,plain,
! [X45,X46] : k4_tarski(X45,X46) = k2_tarski(k2_tarski(X45,X46),k1_tarski(X45)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_18,plain,
! [X134,X135,X136] :
( ( ~ r2_hidden(X134,k9_relat_1(X136,k1_tarski(X135)))
| r2_hidden(k4_tarski(X135,X134),X136)
| ~ v1_relat_1(X136) )
& ( ~ r2_hidden(k4_tarski(X135,X134),X136)
| r2_hidden(X134,k9_relat_1(X136,k1_tarski(X135)))
| ~ v1_relat_1(X136) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_relset_2])])]) ).
cnf(c_0_19,plain,
( r2_hidden(esk9_2(k8_relset_2(X1,X2,X3,X4),X5),k9_relat_1(X4,k1_tarski(X6)))
| r1_tarski(k8_relset_2(X1,X2,X3,X4),X5)
| ~ r2_hidden(X6,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
| ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X119,X120] :
( ~ m1_subset_1(X119,X120)
| v1_xboole_0(X120)
| r2_hidden(X119,X120) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_22,plain,
! [X73] : m1_subset_1(esk12_1(X73),X73),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_23,plain,
( r2_hidden(X2,X5)
| ~ r2_hidden(k4_tarski(X1,X2),X3)
| ~ r2_hidden(X1,X4)
| X5 != k9_relat_1(X3,X4)
| ~ v1_relat_1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( r2_hidden(k4_tarski(X3,X1),X2)
| ~ r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3)))
| ~ v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,X1,esk4_0),X2),k9_relat_1(esk4_0,k1_tarski(X3)))
| r1_tarski(k8_relset_2(esk1_0,esk2_0,X1,esk4_0),X2)
| ~ r2_hidden(X3,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( v1_xboole_0(X2)
| r2_hidden(X1,X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
m1_subset_1(esk12_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X14,X15,X16] :
( ~ m1_subset_1(X16,k1_zfmisc_1(k2_zfmisc_1(X14,X15)))
| v1_relat_1(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_31,plain,
( r2_hidden(X2,X5)
| X5 != k9_relat_1(X3,X4)
| ~ v1_relat_1(X3)
| ~ r2_hidden(X1,X4)
| ~ r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( r2_hidden(k2_tarski(k2_tarski(X3,X1),k1_tarski(X3)),X2)
| ~ v1_relat_1(X2)
| ~ r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3))) ),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,k1_tarski(X2)))
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| ~ r2_hidden(X2,esk3_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( v1_xboole_0(X1)
| r2_hidden(esk12_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( v1_relat_1(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( r2_hidden(X1,X2)
| X2 != k9_relat_1(X3,X4)
| ~ v1_relat_1(X3)
| ~ r2_hidden(X1,k9_relat_1(X3,k1_tarski(X5)))
| ~ r2_hidden(X5,X4) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( v1_xboole_0(esk3_0)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,k1_tarski(esk12_1(esk3_0))))
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
v1_relat_1(esk4_0),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_39,negated_conjecture,
( v1_xboole_0(esk3_0)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),X2)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| X2 != k9_relat_1(esk4_0,X3)
| ~ r2_hidden(esk12_1(esk3_0),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_40,negated_conjecture,
( v1_xboole_0(esk3_0)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),X2)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| X2 != k9_relat_1(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
fof(c_0_41,plain,
! [X129] :
( ~ v1_xboole_0(X129)
| X129 = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_42,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk9_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( v1_xboole_0(esk3_0)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,esk3_0))
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
v1_xboole_0(esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU439+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 09:33:58 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.zAI8SMmRrF/E---3.1_23396.p
% 96.43/12.67 # Version: 3.1pre001
% 96.43/12.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 96.43/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.43/12.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 96.43/12.67 # Starting new_bool_3 with 300s (1) cores
% 96.43/12.67 # Starting new_bool_1 with 300s (1) cores
% 96.43/12.67 # Starting sh5l with 300s (1) cores
% 96.43/12.67 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23511 completed with status 0
% 96.43/12.67 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 96.43/12.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 96.43/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.43/12.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 96.43/12.67 # No SInE strategy applied
% 96.43/12.67 # Search class: FGHSM-FFMM32-MFFFFFNN
% 96.43/12.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 96.43/12.67 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 635s (1) cores
% 96.43/12.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 96.43/12.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 96.43/12.67 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 96.43/12.67 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 96.43/12.67 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 23524 completed with status 0
% 96.43/12.67 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 96.43/12.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 96.43/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.43/12.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 96.43/12.67 # No SInE strategy applied
% 96.43/12.67 # Search class: FGHSM-FFMM32-MFFFFFNN
% 96.43/12.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 96.43/12.67 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 635s (1) cores
% 96.43/12.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 96.43/12.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 96.43/12.67 # Preprocessing time : 0.005 s
% 96.43/12.67
% 96.43/12.67 # Proof found!
% 96.43/12.67 # SZS status Theorem
% 96.43/12.67 # SZS output start CNFRefutation
% See solution above
% 96.43/12.67 # Parsed axioms : 60
% 96.43/12.67 # Removed by relevancy pruning/SinE : 0
% 96.43/12.67 # Initial clauses : 87
% 96.43/12.67 # Removed in clause preprocessing : 11
% 96.43/12.67 # Initial clauses in saturation : 76
% 96.43/12.67 # Processed clauses : 8775
% 96.43/12.67 # ...of these trivial : 52
% 96.43/12.67 # ...subsumed : 4565
% 96.43/12.67 # ...remaining for further processing : 4158
% 96.43/12.67 # Other redundant clauses eliminated : 0
% 96.43/12.67 # Clauses deleted for lack of memory : 0
% 96.43/12.67 # Backward-subsumed : 188
% 96.43/12.67 # Backward-rewritten : 59
% 96.43/12.67 # Generated clauses : 459102
% 96.43/12.67 # ...of the previous two non-redundant : 454646
% 96.43/12.67 # ...aggressively subsumed : 0
% 96.43/12.67 # Contextual simplify-reflections : 69
% 96.43/12.67 # Paramodulations : 458796
% 96.43/12.67 # Factorizations : 0
% 96.43/12.67 # NegExts : 0
% 96.43/12.67 # Equation resolutions : 285
% 96.43/12.67 # Total rewrite steps : 20945
% 96.43/12.67 # Propositional unsat checks : 0
% 96.43/12.67 # Propositional check models : 0
% 96.43/12.67 # Propositional check unsatisfiable : 0
% 96.43/12.67 # Propositional clauses : 0
% 96.43/12.67 # Propositional clauses after purity: 0
% 96.43/12.67 # Propositional unsat core size : 0
% 96.43/12.67 # Propositional preprocessing time : 0.000
% 96.43/12.67 # Propositional encoding time : 0.000
% 96.43/12.67 # Propositional solver time : 0.000
% 96.43/12.67 # Success case prop preproc time : 0.000
% 96.43/12.67 # Success case prop encoding time : 0.000
% 96.43/12.67 # Success case prop solver time : 0.000
% 96.43/12.67 # Current number of processed clauses : 3890
% 96.43/12.67 # Positive orientable unit clauses : 196
% 96.43/12.67 # Positive unorientable unit clauses: 1
% 96.43/12.67 # Negative unit clauses : 55
% 96.43/12.67 # Non-unit-clauses : 3638
% 96.43/12.67 # Current number of unprocessed clauses: 445135
% 96.43/12.67 # ...number of literals in the above : 2253441
% 96.43/12.67 # Current number of archived formulas : 0
% 96.43/12.67 # Current number of archived clauses : 269
% 96.43/12.67 # Clause-clause subsumption calls (NU) : 1788008
% 96.43/12.67 # Rec. Clause-clause subsumption calls : 632878
% 96.43/12.67 # Non-unit clause-clause subsumptions : 3391
% 96.43/12.67 # Unit Clause-clause subsumption calls : 37666
% 96.43/12.67 # Rewrite failures with RHS unbound : 0
% 96.43/12.67 # BW rewrite match attempts : 371
% 96.43/12.67 # BW rewrite match successes : 23
% 96.43/12.67 # Condensation attempts : 0
% 96.43/12.67 # Condensation successes : 0
% 96.43/12.67 # Termbank termtop insertions : 16211335
% 96.43/12.67
% 96.43/12.67 # -------------------------------------------------
% 96.43/12.67 # User time : 11.512 s
% 96.43/12.67 # System time : 0.377 s
% 96.43/12.67 # Total time : 11.889 s
% 96.43/12.67 # Maximum resident set size: 1964 pages
% 96.43/12.67
% 96.43/12.67 # -------------------------------------------------
% 96.43/12.67 # User time : 57.997 s
% 96.43/12.67 # System time : 1.878 s
% 96.43/12.67 # Total time : 59.876 s
% 96.43/12.67 # Maximum resident set size: 1736 pages
% 96.43/12.67 % E---3.1 exiting
% 96.43/12.67 % E---3.1 exiting
%------------------------------------------------------------------------------