TSTP Solution File: SEU422+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU422+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:26 EDT 2023
% Result : Theorem 26.18s 3.79s
% Output : CNFRefutation 26.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 14 unt; 0 def)
% Number of atoms : 151 ( 8 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 169 ( 70 ~; 67 |; 18 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 101 ( 2 sgn; 49 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fraenkel_a_2_0_relset_2,axiom,
! [X1,X2,X3] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X3,k1_zfmisc_1(X2)) )
=> ( r2_hidden(X1,a_2_0_relset_2(X2,X3))
<=> ? [X4] :
( m1_subset_1(X4,X2)
& X1 = k1_tarski(X4)
& r2_hidden(X4,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',fraenkel_a_2_0_relset_2) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3)) )
=> m1_subset_1(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',t4_subset) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3))
& v1_xboole_0(X3) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',t5_subset) ).
fof(t16_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',t16_relset_2) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',t3_subset) ).
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.HhlJXaQEvu/E---3.1_10948.p',d3_tarski) ).
fof(t37_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(k1_tarski(X1),X2)
<=> r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',t37_zfmisc_1) ).
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.HhlJXaQEvu/E---3.1_10948.p',t2_subset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/tmp/tmp.HhlJXaQEvu/E---3.1_10948.p',fc1_subset_1) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X3,k1_zfmisc_1(X2)) )
=> ( r2_hidden(X1,a_2_0_relset_2(X2,X3))
<=> ? [X4] :
( m1_subset_1(X4,X2)
& X1 = k1_tarski(X4)
& r2_hidden(X4,X3) ) ) ),
inference(fof_simplification,[status(thm)],[fraenkel_a_2_0_relset_2]) ).
fof(c_0_10,plain,
! [X24,X25,X26,X28] :
( ( m1_subset_1(esk6_3(X24,X25,X26),X25)
| ~ r2_hidden(X24,a_2_0_relset_2(X25,X26))
| v1_xboole_0(X25)
| ~ m1_subset_1(X26,k1_zfmisc_1(X25)) )
& ( X24 = k1_tarski(esk6_3(X24,X25,X26))
| ~ r2_hidden(X24,a_2_0_relset_2(X25,X26))
| v1_xboole_0(X25)
| ~ m1_subset_1(X26,k1_zfmisc_1(X25)) )
& ( r2_hidden(esk6_3(X24,X25,X26),X26)
| ~ r2_hidden(X24,a_2_0_relset_2(X25,X26))
| v1_xboole_0(X25)
| ~ m1_subset_1(X26,k1_zfmisc_1(X25)) )
& ( ~ m1_subset_1(X28,X25)
| X24 != k1_tarski(X28)
| ~ r2_hidden(X28,X26)
| r2_hidden(X24,a_2_0_relset_2(X25,X26))
| v1_xboole_0(X25)
| ~ m1_subset_1(X26,k1_zfmisc_1(X25)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_11,plain,
! [X17,X18,X19] :
( ~ r2_hidden(X17,X18)
| ~ m1_subset_1(X18,k1_zfmisc_1(X19))
| m1_subset_1(X17,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_12,plain,
! [X20,X21,X22] :
( ~ r2_hidden(X20,X21)
| ~ m1_subset_1(X21,k1_zfmisc_1(X22))
| ~ v1_xboole_0(X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_13,plain,
( r2_hidden(X3,a_2_0_relset_2(X2,X4))
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2)
| X3 != k1_tarski(X1)
| ~ r2_hidden(X1,X4)
| ~ m1_subset_1(X4,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( m1_subset_1(X1,X3)
| ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| ~ v1_xboole_0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t16_relset_2])]) ).
cnf(c_0_17,plain,
( m1_subset_1(esk6_3(X1,X2,X3),X2)
| v1_xboole_0(X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( r2_hidden(k1_tarski(X1),a_2_0_relset_2(X2,X3))
| ~ r2_hidden(X1,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_19,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))
& ~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_20,plain,
! [X48,X49] :
( ( ~ m1_subset_1(X48,k1_zfmisc_1(X49))
| r1_tarski(X48,X49) )
& ( ~ r1_tarski(X48,X49)
| m1_subset_1(X48,k1_zfmisc_1(X49)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_21,plain,
! [X41,X42,X43,X44,X45] :
( ( ~ r1_tarski(X41,X42)
| ~ r2_hidden(X43,X41)
| r2_hidden(X43,X42) )
& ( r2_hidden(esk8_2(X44,X45),X44)
| r1_tarski(X44,X45) )
& ( ~ r2_hidden(esk8_2(X44,X45),X45)
| r1_tarski(X44,X45) ) ),
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_22,plain,
! [X39,X40] :
( ( ~ r1_tarski(k1_tarski(X39),X40)
| r2_hidden(X39,X40) )
& ( ~ r2_hidden(X39,X40)
| r1_tarski(k1_tarski(X39),X40) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_zfmisc_1])]) ).
cnf(c_0_23,plain,
( X1 = k1_tarski(esk6_3(X1,X2,X3))
| v1_xboole_0(X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X15,X16] :
( ~ m1_subset_1(X15,X16)
| v1_xboole_0(X16)
| r2_hidden(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_25,plain,
( m1_subset_1(esk6_3(k1_tarski(X1),X2,X3),X2)
| ~ r2_hidden(X1,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( r2_hidden(esk8_2(X1,X2),X1)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( r1_tarski(k1_tarski(X1),X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( k1_tarski(esk6_3(k1_tarski(X1),X2,X3)) = k1_tarski(X1)
| ~ r2_hidden(X1,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_15]) ).
cnf(c_0_31,plain,
( v1_xboole_0(X2)
| r2_hidden(X1,X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( m1_subset_1(esk6_3(k1_tarski(X1),esk1_0,esk2_0),esk1_0)
| ~ r2_hidden(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,plain,
( r2_hidden(esk8_2(X1,X2),X1)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( r1_tarski(k1_tarski(X1),X2)
| ~ r2_hidden(esk6_3(k1_tarski(X1),X3,X4),X2)
| ~ r2_hidden(X1,X4)
| ~ m1_subset_1(X4,k1_zfmisc_1(X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( r2_hidden(esk6_3(k1_tarski(X1),esk1_0,esk2_0),esk1_0)
| ~ r2_hidden(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
r2_hidden(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),a_2_0_relset_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( r2_hidden(esk6_3(X1,X2,X3),X3)
| v1_xboole_0(X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,negated_conjecture,
( r1_tarski(k1_tarski(X1),esk1_0)
| ~ r2_hidden(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
k1_tarski(esk6_3(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),esk1_0,esk2_0)) = esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_38]),c_0_26])]),c_0_33]) ).
cnf(c_0_42,negated_conjecture,
r2_hidden(esk6_3(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_26])]),c_0_33]) ).
cnf(c_0_43,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_44,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
cnf(c_0_45,negated_conjecture,
r1_tarski(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_46,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r2_hidden(esk8_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
fof(c_0_47,plain,
! [X23] : ~ v1_xboole_0(k1_zfmisc_1(X23)),
inference(variable_rename,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
m1_subset_1(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ r2_hidden(esk8_2(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_48]),c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU422+1 : TPTP v8.1.2. Released v3.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n022.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 09:05:39 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.HhlJXaQEvu/E---3.1_10948.p
% 26.18/3.79 # Version: 3.1pre001
% 26.18/3.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 26.18/3.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.18/3.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.18/3.79 # Starting new_bool_3 with 300s (1) cores
% 26.18/3.79 # Starting new_bool_1 with 300s (1) cores
% 26.18/3.79 # Starting sh5l with 300s (1) cores
% 26.18/3.79 # new_bool_3 with pid 11028 completed with status 0
% 26.18/3.79 # Result found by new_bool_3
% 26.18/3.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 26.18/3.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.18/3.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.18/3.79 # Starting new_bool_3 with 300s (1) cores
% 26.18/3.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 26.18/3.79 # Search class: FGHSM-FFMF31-SFFFFFNN
% 26.18/3.79 # partial match(1): FGHSM-FFMM31-SFFFFFNN
% 26.18/3.79 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 26.18/3.79 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 26.18/3.79 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11031 completed with status 0
% 26.18/3.79 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 26.18/3.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 26.18/3.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.18/3.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.18/3.79 # Starting new_bool_3 with 300s (1) cores
% 26.18/3.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 26.18/3.79 # Search class: FGHSM-FFMF31-SFFFFFNN
% 26.18/3.79 # partial match(1): FGHSM-FFMM31-SFFFFFNN
% 26.18/3.79 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 26.18/3.79 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 26.18/3.79 # Preprocessing time : 0.001 s
% 26.18/3.79 # Presaturation interreduction done
% 26.18/3.79
% 26.18/3.79 # Proof found!
% 26.18/3.79 # SZS status Theorem
% 26.18/3.79 # SZS output start CNFRefutation
% See solution above
% 26.18/3.79 # Parsed axioms : 30
% 26.18/3.79 # Removed by relevancy pruning/SinE : 11
% 26.18/3.79 # Initial clauses : 31
% 26.18/3.79 # Removed in clause preprocessing : 0
% 26.18/3.79 # Initial clauses in saturation : 31
% 26.18/3.79 # Processed clauses : 9693
% 26.18/3.79 # ...of these trivial : 170
% 26.18/3.79 # ...subsumed : 7009
% 26.18/3.79 # ...remaining for further processing : 2514
% 26.18/3.79 # Other redundant clauses eliminated : 1
% 26.18/3.79 # Clauses deleted for lack of memory : 0
% 26.18/3.79 # Backward-subsumed : 155
% 26.18/3.79 # Backward-rewritten : 21
% 26.18/3.79 # Generated clauses : 206114
% 26.18/3.79 # ...of the previous two non-redundant : 153766
% 26.18/3.79 # ...aggressively subsumed : 0
% 26.18/3.79 # Contextual simplify-reflections : 18
% 26.18/3.79 # Paramodulations : 206085
% 26.18/3.79 # Factorizations : 28
% 26.18/3.79 # NegExts : 0
% 26.18/3.79 # Equation resolutions : 1
% 26.18/3.79 # Total rewrite steps : 60889
% 26.18/3.79 # Propositional unsat checks : 0
% 26.18/3.79 # Propositional check models : 0
% 26.18/3.79 # Propositional check unsatisfiable : 0
% 26.18/3.79 # Propositional clauses : 0
% 26.18/3.79 # Propositional clauses after purity: 0
% 26.18/3.79 # Propositional unsat core size : 0
% 26.18/3.79 # Propositional preprocessing time : 0.000
% 26.18/3.79 # Propositional encoding time : 0.000
% 26.18/3.79 # Propositional solver time : 0.000
% 26.18/3.79 # Success case prop preproc time : 0.000
% 26.18/3.79 # Success case prop encoding time : 0.000
% 26.18/3.79 # Success case prop solver time : 0.000
% 26.18/3.79 # Current number of processed clauses : 2306
% 26.18/3.79 # Positive orientable unit clauses : 240
% 26.18/3.79 # Positive unorientable unit clauses: 8
% 26.18/3.79 # Negative unit clauses : 384
% 26.18/3.79 # Non-unit-clauses : 1674
% 26.18/3.79 # Current number of unprocessed clauses: 143866
% 26.18/3.79 # ...number of literals in the above : 472989
% 26.18/3.79 # Current number of archived formulas : 0
% 26.18/3.79 # Current number of archived clauses : 207
% 26.18/3.79 # Clause-clause subsumption calls (NU) : 324964
% 26.18/3.79 # Rec. Clause-clause subsumption calls : 213794
% 26.18/3.79 # Non-unit clause-clause subsumptions : 4069
% 26.18/3.79 # Unit Clause-clause subsumption calls : 43337
% 26.18/3.79 # Rewrite failures with RHS unbound : 0
% 26.18/3.79 # BW rewrite match attempts : 786
% 26.18/3.79 # BW rewrite match successes : 62
% 26.18/3.79 # Condensation attempts : 0
% 26.18/3.79 # Condensation successes : 0
% 26.18/3.79 # Termbank termtop insertions : 3786995
% 26.18/3.79
% 26.18/3.79 # -------------------------------------------------
% 26.18/3.79 # User time : 3.131 s
% 26.18/3.79 # System time : 0.103 s
% 26.18/3.79 # Total time : 3.234 s
% 26.18/3.79 # Maximum resident set size: 1876 pages
% 26.18/3.79
% 26.18/3.79 # -------------------------------------------------
% 26.18/3.79 # User time : 3.134 s
% 26.18/3.79 # System time : 0.103 s
% 26.18/3.79 # Total time : 3.237 s
% 26.18/3.79 # Maximum resident set size: 1696 pages
% 26.18/3.79 % E---3.1 exiting
% 26.18/3.79 % E---3.1 exiting
%------------------------------------------------------------------------------