TSTP Solution File: SEU416+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU416+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:24 EDT 2023
% Result : Theorem 738.58s 102.26s
% Output : CNFRefutation 738.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 60 ( 57 unt; 0 def)
% Number of atoms : 65 ( 64 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 105 ( 7 sgn; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t48_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t3_boole) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t2_boole) ).
fof(t41_xboole_1,axiom,
! [X1,X2,X3] : k4_xboole_0(k4_xboole_0(X1,X2),X3) = k4_xboole_0(X1,k2_xboole_0(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t41_xboole_1) ).
fof(t39_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t39_xboole_1) ).
fof(t40_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(k2_xboole_0(X1,X2),X2) = k4_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t40_xboole_1) ).
fof(t3_relset_2,axiom,
! [X1,X2] : k3_pua2mss1(k2_xboole_0(X1,X2)) = k2_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t3_relset_2) ).
fof(t47_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t47_xboole_1) ).
fof(t4_relset_2,axiom,
! [X1,X2] : k3_pua2mss1(k3_xboole_0(X1,X2)) = k3_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t4_relset_2) ).
fof(t22_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k3_xboole_0(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t22_xboole_1) ).
fof(t49_xboole_1,axiom,
! [X1,X2,X3] : k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t49_xboole_1) ).
fof(t2_relset_2,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> k3_pua2mss1(X1) = k1_xboole_0 ),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t2_relset_2) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',idempotence_k3_xboole_0) ).
fof(t5_relset_2,conjecture,
! [X1,X2] : k3_pua2mss1(k4_xboole_0(X1,X2)) = k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',t5_relset_2) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.eED3aOfkIm/E---3.1_28742.p',commutativity_k2_xboole_0) ).
fof(c_0_15,plain,
! [X68,X69] : k4_xboole_0(X68,k4_xboole_0(X68,X69)) = k3_xboole_0(X68,X69),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_16,plain,
! [X26] : k4_xboole_0(X26,k1_xboole_0) = X26,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_17,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X599] : k3_xboole_0(X599,k1_xboole_0) = k1_xboole_0,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_20,plain,
! [X50,X51,X52] : k4_xboole_0(k4_xboole_0(X50,X51),X52) = k4_xboole_0(X50,k2_xboole_0(X51,X52)),
inference(variable_rename,[status(thm)],[t41_xboole_1]) ).
cnf(c_0_21,plain,
k4_xboole_0(X1,X1) = k3_xboole_0(X1,k1_xboole_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X46,X47] : k2_xboole_0(X46,k4_xboole_0(X47,X46)) = k2_xboole_0(X46,X47),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
fof(c_0_24,plain,
! [X48,X49] : k4_xboole_0(k2_xboole_0(X48,X49),X49) = k4_xboole_0(X48,X49),
inference(variable_rename,[status(thm)],[t40_xboole_1]) ).
fof(c_0_25,plain,
! [X220,X221] : k3_pua2mss1(k2_xboole_0(X220,X221)) = k2_xboole_0(k3_pua2mss1(X220),k3_pua2mss1(X221)),
inference(variable_rename,[status(thm)],[t3_relset_2]) ).
fof(c_0_26,plain,
! [X66,X67] : k4_xboole_0(X66,k3_xboole_0(X66,X67)) = k4_xboole_0(X66,X67),
inference(variable_rename,[status(thm)],[t47_xboole_1]) ).
fof(c_0_27,plain,
! [X222,X223] : k3_pua2mss1(k3_xboole_0(X222,X223)) = k3_xboole_0(k3_pua2mss1(X222),k3_pua2mss1(X223)),
inference(variable_rename,[status(thm)],[t4_relset_2]) ).
cnf(c_0_28,plain,
k4_xboole_0(k4_xboole_0(X1,X2),X3) = k4_xboole_0(X1,k2_xboole_0(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X463,X464] : k2_xboole_0(X463,k3_xboole_0(X463,X464)) = X463,
inference(variable_rename,[status(thm)],[t22_xboole_1]) ).
fof(c_0_32,plain,
! [X70,X71,X72] : k3_xboole_0(X70,k4_xboole_0(X71,X72)) = k4_xboole_0(k3_xboole_0(X70,X71),X72),
inference(variable_rename,[status(thm)],[t49_xboole_1]) ).
fof(c_0_33,plain,
! [X219] :
( ( X219 != k1_xboole_0
| k3_pua2mss1(X219) = k1_xboole_0 )
& ( k3_pua2mss1(X219) != k1_xboole_0
| X219 = k1_xboole_0 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_relset_2])]) ).
cnf(c_0_34,plain,
k4_xboole_0(k2_xboole_0(X1,X2),X2) = k4_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
k3_pua2mss1(k2_xboole_0(X1,X2)) = k2_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
k3_pua2mss1(k3_xboole_0(X1,X2)) = k3_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
k4_xboole_0(X1,k2_xboole_0(X2,X1)) = k1_xboole_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_39,plain,
k2_xboole_0(X1,k3_xboole_0(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( k3_pua2mss1(X1) = k1_xboole_0
| X1 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_42,plain,
! [X598] : k3_xboole_0(X598,X598) = X598,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_43,plain,
k4_xboole_0(k3_pua2mss1(k2_xboole_0(X1,X2)),k3_pua2mss1(X2)) = k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(k3_xboole_0(X1,X2))) = k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
k3_xboole_0(X1,k4_xboole_0(X2,X1)) = k1_xboole_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
k3_pua2mss1(k1_xboole_0) = k1_xboole_0,
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
k3_xboole_0(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_48,negated_conjecture,
~ ! [X1,X2] : k3_pua2mss1(k4_xboole_0(X1,X2)) = k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)),
inference(assume_negation,[status(cth)],[t5_relset_2]) ).
cnf(c_0_49,plain,
k4_xboole_0(k3_pua2mss1(k2_xboole_0(X1,X2)),k3_pua2mss1(k4_xboole_0(X2,X1))) = k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(k4_xboole_0(X2,X1))),
inference(spm,[status(thm)],[c_0_43,c_0_30]) ).
cnf(c_0_50,plain,
k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(k4_xboole_0(X2,X1))) = k3_pua2mss1(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_18]) ).
fof(c_0_51,plain,
! [X423,X424] : k2_xboole_0(X423,X424) = k2_xboole_0(X424,X423),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_52,plain,
k3_xboole_0(X1,k4_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_47]) ).
fof(c_0_53,negated_conjecture,
k3_pua2mss1(k4_xboole_0(esk1_0,esk2_0)) != k4_xboole_0(k3_pua2mss1(esk1_0),k3_pua2mss1(esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])]) ).
cnf(c_0_54,plain,
k4_xboole_0(k3_pua2mss1(k2_xboole_0(X1,X2)),k3_pua2mss1(k4_xboole_0(X2,X1))) = k3_pua2mss1(X1),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,plain,
k2_xboole_0(X1,k4_xboole_0(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
k3_pua2mss1(k4_xboole_0(esk1_0,esk2_0)) != k4_xboole_0(k3_pua2mss1(esk1_0),k3_pua2mss1(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
k4_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2)) = k3_pua2mss1(k4_xboole_0(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_17]),c_0_55]),c_0_56]),c_0_44]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.28/2.37 % Problem : SEU416+3 : TPTP v8.1.2. Released v3.4.0.
% 2.28/2.39 % Command : run_E %s %d THM
% 2.37/2.58 % Computer : n008.cluster.edu
% 2.37/2.58 % Model : x86_64 x86_64
% 2.37/2.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.37/2.58 % Memory : 8042.1875MB
% 2.37/2.58 % OS : Linux 3.10.0-693.el7.x86_64
% 2.37/2.59 % CPULimit : 2400
% 2.37/2.59 % WCLimit : 300
% 2.37/2.59 % DateTime : Mon Oct 2 08:19:17 EDT 2023
% 2.37/2.59 % CPUTime :
% 8.20/8.49 Running first-order theorem proving
% 8.20/8.49 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/tmp/tmp.eED3aOfkIm/E---3.1_28742.p
% 738.58/102.26 # Version: 3.1pre001
% 738.58/102.26 # Preprocessing class: FMLLMMLLSSSNFFN.
% 738.58/102.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 738.58/102.26 # Starting new_bool_3 with 900s (3) cores
% 738.58/102.26 # Starting new_bool_1 with 900s (3) cores
% 738.58/102.26 # Starting sh5l with 300s (1) cores
% 738.58/102.26 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 738.58/102.26 # new_bool_3 with pid 28824 completed with status 0
% 738.58/102.26 # Result found by new_bool_3
% 738.58/102.26 # Preprocessing class: FMLLMMLLSSSNFFN.
% 738.58/102.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 738.58/102.26 # Starting new_bool_3 with 900s (3) cores
% 738.58/102.26 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 738.58/102.26 # Search class: FGHSM-SMLM32-MFFFFFNN
% 738.58/102.26 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 738.58/102.26 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 738.58/102.26 # Starting new_bool_3 with 91s (1) cores
% 738.58/102.26 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 738.58/102.26 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 28831 completed with status 7
% 738.58/102.26 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 68s (1) cores
% 738.58/102.26 # G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 28833 completed with status 7
% 738.58/102.26 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 68s (1) cores
% 738.58/102.26 # new_bool_3 with pid 28832 completed with status 7
% 738.58/102.26 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 68s (1) cores
% 738.58/102.26 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 28854 completed with status 0
% 738.58/102.26 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 738.58/102.26 # Preprocessing class: FMLLMMLLSSSNFFN.
% 738.58/102.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 738.58/102.26 # Starting new_bool_3 with 900s (3) cores
% 738.58/102.26 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 738.58/102.26 # Search class: FGHSM-SMLM32-MFFFFFNN
% 738.58/102.26 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 738.58/102.26 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 738.58/102.26 # Starting new_bool_3 with 91s (1) cores
% 738.58/102.26 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 738.58/102.26 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 28831 completed with status 7
% 738.58/102.26 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 68s (1) cores
% 738.58/102.26 # G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 28833 completed with status 7
% 738.58/102.26 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 68s (1) cores
% 738.58/102.26 # new_bool_3 with pid 28832 completed with status 7
% 738.58/102.26 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 68s (1) cores
% 738.58/102.26 # Preprocessing time : 0.039 s
% 738.58/102.26
% 738.58/102.26 # Proof found!
% 738.58/102.26 # SZS status Theorem
% 738.58/102.26 # SZS output start CNFRefutation
% See solution above
% 738.58/102.26 # Parsed axioms : 19072
% 738.58/102.26 # Removed by relevancy pruning/SinE : 17816
% 738.58/102.26 # Initial clauses : 2468
% 738.58/102.26 # Removed in clause preprocessing : 46
% 738.58/102.26 # Initial clauses in saturation : 2422
% 738.58/102.26 # Processed clauses : 659
% 738.58/102.26 # ...of these trivial : 62
% 738.58/102.26 # ...subsumed : 106
% 738.58/102.26 # ...remaining for further processing : 491
% 738.58/102.26 # Other redundant clauses eliminated : 18
% 738.58/102.26 # Clauses deleted for lack of memory : 0
% 738.58/102.26 # Backward-subsumed : 1
% 738.58/102.26 # Backward-rewritten : 61
% 738.58/102.26 # Generated clauses : 2387
% 738.58/102.26 # ...of the previous two non-redundant : 1401
% 738.58/102.26 # ...aggressively subsumed : 0
% 738.58/102.26 # Contextual simplify-reflections : 0
% 738.58/102.26 # Paramodulations : 2367
% 738.58/102.26 # Factorizations : 1
% 738.58/102.26 # NegExts : 0
% 738.58/102.26 # Equation resolutions : 19
% 738.58/102.26 # Total rewrite steps : 3139
% 738.58/102.26 # Propositional unsat checks : 0
% 738.58/102.26 # Propositional check models : 0
% 738.58/102.26 # Propositional check unsatisfiable : 0
% 738.58/102.26 # Propositional clauses : 0
% 738.58/102.26 # Propositional clauses after purity: 0
% 738.58/102.26 # Propositional unsat core size : 0
% 738.58/102.26 # Propositional preprocessing time : 0.000
% 738.58/102.26 # Propositional encoding time : 0.000
% 738.58/102.26 # Propositional solver time : 0.000
% 738.58/102.26 # Success case prop preproc time : 0.000
% 738.58/102.26 # Success case prop encoding time : 0.000
% 738.58/102.26 # Success case prop solver time : 0.000
% 738.58/102.26 # Current number of processed clauses : 417
% 738.58/102.26 # Positive orientable unit clauses : 266
% 738.58/102.26 # Positive unorientable unit clauses: 3
% 738.58/102.26 # Negative unit clauses : 55
% 738.58/102.26 # Non-unit-clauses : 93
% 738.58/102.26 # Current number of unprocessed clauses: 3158
% 738.58/102.26 # ...number of literals in the above : 10955
% 738.58/102.26 # Current number of archived formulas : 0
% 738.58/102.26 # Current number of archived clauses : 62
% 738.58/102.26 # Clause-clause subsumption calls (NU) : 1651
% 738.58/102.26 # Rec. Clause-clause subsumption calls : 1123
% 738.58/102.26 # Non-unit clause-clause subsumptions : 16
% 738.58/102.26 # Unit Clause-clause subsumption calls : 1400
% 738.58/102.26 # Rewrite failures with RHS unbound : 0
% 738.58/102.26 # BW rewrite match attempts : 300
% 738.58/102.26 # BW rewrite match successes : 98
% 738.58/102.26 # Condensation attempts : 0
% 738.58/102.26 # Condensation successes : 0
% 738.58/102.26 # Termbank termtop insertions : 726315
% 738.58/102.26
% 738.58/102.26 # -------------------------------------------------
% 738.58/102.26 # User time : 224.374 s
% 738.58/102.26 # System time : 3.310 s
% 738.58/102.26 # Total time : 227.683 s
% 738.58/102.26 # Maximum resident set size: 39704 pages
% 738.58/102.26
% 738.58/102.26 # -------------------------------------------------
% 738.58/102.26 # User time : 268.113 s
% 738.58/102.26 # System time : 4.539 s
% 738.58/102.26 # Total time : 272.652 s
% 738.58/102.26 # Maximum resident set size: 29680 pages
% 738.58/102.26 % E---3.1 exiting
% 738.58/102.26 % E---3.1 exiting
%------------------------------------------------------------------------------