TSTP Solution File: SEU449+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU449+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:32:16 EDT 2023
% Result : Theorem 845.75s 109.87s
% Output : CNFRefutation 845.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 108 ( 48 ~; 38 |; 8 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 77 ( 1 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5)))
& r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',t63_relset_2) ).
fof(t61_relset_2,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)))
<=> r1_tarski(X4,k8_relset_2(X1,X2,X3,X5)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',t61_relset_2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',reflexivity_r1_tarski) ).
fof(dt_k8_relset_2,axiom,
! [X1,X2,X3,X4] :
( ( m1_subset_1(X3,k1_zfmisc_1(X1))
& m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) )
=> m1_subset_1(k8_relset_2(X1,X2,X3,X4),k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',dt_k8_relset_2) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',dt_m2_relset_1) ).
fof(dt_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',dt_k6_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
<=> m1_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.aC8xnn3D27/E---3.1_430.p',redefinition_m2_relset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5)))
& r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5)) ) ) ) ),
inference(assume_negation,[status(cth)],[t63_relset_2]) ).
fof(c_0_8,plain,
! [X182,X183,X184,X185,X186] :
( ( ~ r1_tarski(X184,k8_relset_2(X183,X182,X185,k6_relset_1(X182,X183,X186)))
| r1_tarski(X185,k8_relset_2(X182,X183,X184,X186))
| ~ m2_relset_1(X186,X182,X183)
| ~ m1_subset_1(X185,k1_zfmisc_1(X183))
| ~ m1_subset_1(X184,k1_zfmisc_1(X182)) )
& ( ~ r1_tarski(X185,k8_relset_2(X182,X183,X184,X186))
| r1_tarski(X184,k8_relset_2(X183,X182,X185,k6_relset_1(X182,X183,X186)))
| ~ m2_relset_1(X186,X182,X183)
| ~ m1_subset_1(X185,k1_zfmisc_1(X183))
| ~ m1_subset_1(X184,k1_zfmisc_1(X182)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_relset_2])])])]) ).
fof(c_0_9,plain,
! [X26] : r1_tarski(X26,X26),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_10,negated_conjecture,
( m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0))
& m2_relset_1(esk5_0,esk1_0,esk2_0)
& ( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( r1_tarski(X4,k8_relset_2(X3,X2,X1,X5))
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,k6_relset_1(X3,X2,X5)))
| ~ m2_relset_1(X5,X3,X2)
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),X4))
| ~ m2_relset_1(X4,X2,X3)
| ~ m1_subset_1(k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
m2_relset_1(esk5_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
( r1_tarski(X4,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X5)))
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,X5))
| ~ m2_relset_1(X5,X2,X3)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X89,X90,X91,X92] :
( ~ m1_subset_1(X91,k1_zfmisc_1(X89))
| ~ m1_subset_1(X92,k1_zfmisc_1(k2_zfmisc_1(X89,X90)))
| m1_subset_1(k8_relset_2(X89,X90,X91,X92),k1_zfmisc_1(X90)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relset_2])]) ).
cnf(c_0_21,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_19]),c_0_12])]) ).
cnf(c_0_22,plain,
( m1_subset_1(k8_relset_2(X2,X4,X1,X3),k1_zfmisc_1(X4))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X297,X298,X299] :
( ~ m2_relset_1(X299,X297,X298)
| m1_subset_1(X299,k1_zfmisc_1(k2_zfmisc_1(X297,X298))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_24,negated_conjecture,
( ~ m1_subset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk1_0)))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]) ).
cnf(c_0_25,plain,
( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X163,X164,X165] :
( ~ m1_relset_1(X165,X163,X164)
| m2_relset_1(k6_relset_1(X163,X164,X165),X164,X163) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_relset_1])]) ).
cnf(c_0_27,negated_conjecture,
( ~ m2_relset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),esk2_0,esk1_0)
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2)
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ m1_relset_1(esk5_0,esk1_0,esk2_0)
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_30,plain,
! [X923,X924,X925] :
( ( ~ m2_relset_1(X925,X923,X924)
| m1_relset_1(X925,X923,X924) )
& ( ~ m1_relset_1(X925,X923,X924)
| m2_relset_1(X925,X923,X924) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_31,negated_conjecture,
( ~ m1_relset_1(esk5_0,esk1_0,esk2_0)
| ~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_19])]) ).
cnf(c_0_32,plain,
( m1_relset_1(X1,X2,X3)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SEU449+3 : TPTP v8.1.2. Released v3.4.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.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 : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 09:01:02 EDT 2023
% 0.09/0.30 % CPUTime :
% 2.38/2.64 Running first-order model finding
% 2.38/2.64 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.aC8xnn3D27/E---3.1_430.p
% 845.75/109.87 # Version: 3.1pre001
% 845.75/109.87 # Preprocessing class: FMLLMMLLSSSNFFN.
% 845.75/109.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 845.75/109.87 # Starting new_bool_3 with 900s (3) cores
% 845.75/109.87 # Starting new_bool_1 with 900s (3) cores
% 845.75/109.87 # Starting sh5l with 300s (1) cores
% 845.75/109.87 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 845.75/109.87 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 527 completed with status 0
% 845.75/109.87 # Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 845.75/109.87 # Preprocessing class: FMLLMMLLSSSNFFN.
% 845.75/109.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 845.75/109.87 # Starting new_bool_3 with 900s (3) cores
% 845.75/109.87 # Starting new_bool_1 with 900s (3) cores
% 845.75/109.87 # Starting sh5l with 300s (1) cores
% 845.75/109.87 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 845.75/109.87 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 845.75/109.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 845.75/109.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 845.75/109.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 845.75/109.87 # G-E--_303_C18_F1_URBAN_S0Y with pid 528 completed with status 7
% 845.75/109.87 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 31s (1) cores
% 845.75/109.87 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 539 completed with status 7
% 845.75/109.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 845.75/109.87 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 812 completed with status 7
% 845.75/109.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 845.75/109.87 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 1525 completed with status 0
% 845.75/109.87 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 845.75/109.87 # Preprocessing class: FMLLMMLLSSSNFFN.
% 845.75/109.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 845.75/109.87 # Starting new_bool_3 with 900s (3) cores
% 845.75/109.87 # Starting new_bool_1 with 900s (3) cores
% 845.75/109.87 # Starting sh5l with 300s (1) cores
% 845.75/109.87 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 845.75/109.87 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 845.75/109.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 845.75/109.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 845.75/109.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 845.75/109.87 # G-E--_303_C18_F1_URBAN_S0Y with pid 528 completed with status 7
% 845.75/109.87 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 31s (1) cores
% 845.75/109.87 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 539 completed with status 7
% 845.75/109.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 845.75/109.87 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 812 completed with status 7
% 845.75/109.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 845.75/109.87 # Preprocessing time : 0.023 s
% 845.75/109.87 # Presaturation interreduction done
% 845.75/109.87
% 845.75/109.87 # Proof found!
% 845.75/109.87 # SZS status Theorem
% 845.75/109.87 # SZS output start CNFRefutation
% See solution above
% 845.75/109.87 # Parsed axioms : 19134
% 845.75/109.87 # Removed by relevancy pruning/SinE : 18633
% 845.75/109.87 # Initial clauses : 1026
% 845.75/109.87 # Removed in clause preprocessing : 31
% 845.75/109.87 # Initial clauses in saturation : 995
% 845.75/109.87 # Processed clauses : 49644
% 845.75/109.87 # ...of these trivial : 166
% 845.75/109.87 # ...subsumed : 35982
% 845.75/109.87 # ...remaining for further processing : 13496
% 845.75/109.87 # Other redundant clauses eliminated : 2140
% 845.75/109.87 # Clauses deleted for lack of memory : 0
% 845.75/109.87 # Backward-subsumed : 1045
% 845.75/109.87 # Backward-rewritten : 110
% 845.75/109.87 # Generated clauses : 809784
% 845.75/109.87 # ...of the previous two non-redundant : 776380
% 845.75/109.87 # ...aggressively subsumed : 0
% 845.75/109.87 # Contextual simplify-reflections : 843
% 845.75/109.87 # Paramodulations : 807570
% 845.75/109.87 # Factorizations : 13
% 845.75/109.87 # NegExts : 0
% 845.75/109.87 # Equation resolutions : 2207
% 845.75/109.87 # Total rewrite steps : 141802
% 845.75/109.87 # Propositional unsat checks : 2
% 845.75/109.87 # Propositional check models : 0
% 845.75/109.87 # Propositional check unsatisfiable : 0
% 845.75/109.87 # Propositional clauses : 0
% 845.75/109.87 # Propositional clauses after purity: 0
% 845.75/109.87 # Propositional unsat core size : 0
% 845.75/109.87 # Propositional preprocessing time : 0.000
% 845.75/109.87 # Propositional encoding time : 1.018
% 845.75/109.87 # Propositional solver time : 0.545
% 845.75/109.87 # Success case prop preproc time : 0.000
% 845.75/109.87 # Success case prop encoding time : 0.000
% 845.75/109.87 # Success case prop solver time : 0.000
% 845.75/109.87 # Current number of processed clauses : 11340
% 845.75/109.87 # Positive orientable unit clauses : 353
% 845.75/109.87 # Positive unorientable unit clauses: 1
% 845.75/109.87 # Negative unit clauses : 382
% 845.75/109.87 # Non-unit-clauses : 10604
% 845.75/109.87 # Current number of unprocessed clauses: 727203
% 845.75/109.87 # ...number of literals in the above : 3397249
% 845.75/109.87 # Current number of archived formulas : 0
% 845.75/109.87 # Current number of archived clauses : 2056
% 845.75/109.87 # Clause-clause subsumption calls (NU) : 22116948
% 845.75/109.87 # Rec. Clause-clause subsumption calls : 9438314
% 845.75/109.87 # Non-unit clause-clause subsumptions : 23000
% 845.75/109.87 # Unit Clause-clause subsumption calls : 231023
% 845.75/109.87 # Rewrite failures with RHS unbound : 0
% 845.75/109.87 # BW rewrite match attempts : 640
% 845.75/109.87 # BW rewrite match successes : 44
% 845.75/109.87 # Condensation attempts : 0
% 845.75/109.87 # Condensation successes : 0
% 845.75/109.87 # Termbank termtop insertions : 19755528
% 845.75/109.87
% 845.75/109.87 # -------------------------------------------------
% 845.75/109.87 # User time : 103.216 s
% 845.75/109.87 # System time : 2.478 s
% 845.75/109.87 # Total time : 105.695 s
% 845.75/109.87 # Maximum resident set size: 38884 pages
% 845.75/109.87
% 845.75/109.87 # -------------------------------------------------
% 845.75/109.87 # User time : 104.095 s
% 845.75/109.87 # System time : 2.499 s
% 845.75/109.87 # Total time : 106.594 s
% 845.75/109.87 # Maximum resident set size: 29784 pages
% 845.75/109.87 % E---3.1 exiting
%------------------------------------------------------------------------------