TSTP Solution File: NUM856+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM856+2 : TPTP v8.2.0. Released v4.1.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:17:35 EDT 2024
% Result : Theorem 1.61s 0.71s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 74 ( 25 unt; 0 def)
% Number of atoms : 151 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 137 ( 60 ~; 59 |; 10 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 133 ( 2 sgn 74 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(scope(318)), 525, 0)',conjecture,
greater(vmul(vd517,vd519),vmul(vd518,vd520)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(scope(318)), 525, 0)') ).
fof('ass(cond(312, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X3,X4)
& greater(X1,X2) )
=> greater(vmul(X1,X3),vmul(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(312, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X74,X75] :
( geq(X75,X74)
<=> ( greater(X75,X74)
| X75 = X74 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(scope(318)))',axiom,
( ( greater(vd519,vd520)
& geq(vd517,vd518) )
| ( geq(vd519,vd520)
& greater(vd517,vd518) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(antec(scope(318)))') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X88,X89] :
( X88 != X89
| ~ ? [X91] : X89 = vplus(X88,X91) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof('ass(cond(conjunct1(307), 0), 0)',axiom,
! [X11,X12,X13] :
( greater(vmul(X11,X12),vmul(X13,X12))
=> greater(X11,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conjunct1(307), 0), 0)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X24,X25,X26] : vmul(X24,vplus(X25,X26)) = vplus(vmul(X24,X25),vmul(X24,X26)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X85,X86] :
( greater(X86,X85)
<=> ? [X87] : X86 = vplus(X85,X87) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X14,X19,X20] :
( greater(X19,X20)
=> greater(vmul(X19,X14),vmul(X20,X14)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(299, 0), 2)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X80,X81] :
( X80 != X81
| ~ less(X80,X81) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X65,X66,X67] :
( ( less(X66,X67)
& less(X65,X66) )
=> less(X65,X67) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X78,X79] :
( greater(X78,X79)
=> less(X79,X78) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X27,X28] : vmul(X27,X28) = vmul(X28,X27),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('ass(cond(conjunct2(conjunct2(307)), 0), 0)',axiom,
! [X5,X6,X7] :
( less(vmul(X5,X6),vmul(X7,X6))
=> less(X5,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conjunct2(conjunct2(307)), 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X80,X81] :
( X80 = X81
| greater(X80,X81)
| less(X80,X81) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(c_0_15,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(scope(318)), 525, 0)'])]) ).
fof(c_0_16,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
fof(c_0_17,plain,
! [X114,X115,X116,X117] :
( ~ greater(X116,X117)
| ~ greater(X114,X115)
| greater(vmul(X114,X116),vmul(X115,X117)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(312, 0), 0)'])])]) ).
fof(c_0_18,plain,
! [X201,X202] :
( ( ~ geq(X202,X201)
| greater(X202,X201)
| X202 = X201 )
& ( ~ greater(X202,X201)
| geq(X202,X201) )
& ( X202 != X201
| geq(X202,X201) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
fof(c_0_19,plain,
( ( geq(vd519,vd520)
| greater(vd519,vd520) )
& ( greater(vd517,vd518)
| greater(vd519,vd520) )
& ( geq(vd519,vd520)
| geq(vd517,vd518) )
& ( greater(vd517,vd518)
| geq(vd517,vd518) ) ),
inference(distribute,[status(thm)],['dis(antec(scope(318)))']) ).
cnf(c_0_20,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( greater(vmul(X3,X1),vmul(X4,X2))
| ~ greater(X1,X2)
| ~ greater(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( greater(X1,X2)
| X1 = X2
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( geq(vd519,vd520)
| greater(vd519,vd520) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X88,X89] :
( X88 != X89
| ~ ? [X91] : X89 = vplus(X88,X91) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
cnf(c_0_25,negated_conjecture,
( ~ greater(vd517,vd518)
| ~ greater(vd519,vd520) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( vd520 = vd519
| greater(vd519,vd520) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X124,X125,X126] :
( ~ greater(vmul(X124,X125),vmul(X126,X125))
| greater(X124,X126) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conjunct1(307), 0), 0)'])])]) ).
fof(c_0_28,plain,
! [X231,X232,X233] :
( X231 != X232
| X232 != vplus(X231,X233) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_29,plain,
! [X139,X140,X141] : vmul(X139,vplus(X140,X141)) = vplus(vmul(X139,X140),vmul(X139,X141)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
fof(c_0_30,plain,
! [X221,X222,X224,X225,X226] :
( ( ~ greater(X222,X221)
| X222 = vplus(X221,esk2_2(X221,X222)) )
& ( X225 != vplus(X224,X226)
| greater(X225,X224) ) ),
inference(fof_nnf,[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)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( vd520 = vd519
| ~ greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( greater(X1,X3)
| ~ greater(vmul(X1,X2),vmul(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X133,X134,X135] :
( ~ greater(X134,X135)
| greater(vmul(X134,X133),vmul(X135,X133)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])])]) ).
cnf(c_0_34,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd519)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_32]) ).
cnf(c_0_38,plain,
( greater(vmul(X1,X3),vmul(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_39,plain,
! [X80,X81] :
( X80 != X81
| ~ less(X80,X81) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)']) ).
fof(c_0_40,plain,
! [X192,X193,X194] :
( ~ less(X193,X194)
| ~ less(X192,X193)
| less(X192,X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])])]) ).
fof(c_0_41,plain,
! [X205,X206] :
( ~ greater(X205,X206)
| less(X206,X205) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).
cnf(c_0_42,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( vplus(vmul(X1,X2),vmul(X1,esk2_2(X2,X3))) = vmul(X1,X3)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
( greater(vd517,vd518)
| greater(vd519,vd520) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_45,negated_conjecture,
~ greater(vd517,vd518),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_46,plain,
! [X209,X210] :
( X209 != X210
| ~ less(X209,X210) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_39])]) ).
cnf(c_0_47,plain,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
( vmul(X1,X2) != vmul(X1,X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
greater(vd519,vd520),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_51,plain,
! [X142,X143] : vmul(X142,X143) = vmul(X143,X142),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_52,plain,
( X1 != X2
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ greater(X3,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_54,plain,
! [X118,X119,X120] :
( ~ less(vmul(X118,X119),vmul(X120,X119))
| less(X118,X120) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conjunct2(conjunct2(307)), 0), 0)'])])]) ).
fof(c_0_55,plain,
! [X207,X208] :
( X207 = X208
| greater(X207,X208)
| less(X207,X208) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_56,plain,
vmul(X1,vd520) != vmul(X1,vd519),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
( less(vd520,X1)
| ~ less(vd519,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_50]) ).
cnf(c_0_60,plain,
( less(X1,X3)
| ~ less(vmul(X1,X2),vmul(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,plain,
vmul(vd520,X1) != vmul(X1,vd519),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( greater(vd517,vd518)
| geq(vd517,vd518) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_64,plain,
~ less(vd519,vd520),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
( vmul(X1,X2) = vmul(X3,X2)
| less(X1,X3)
| greater(vmul(X1,X2),vmul(X3,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
vmul(vd520,X1) != vmul(vd519,X1),
inference(spm,[status(thm)],[c_0_62,c_0_57]) ).
cnf(c_0_67,plain,
( vd518 = vd517
| greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_22,c_0_63]) ).
cnf(c_0_68,plain,
greater(vmul(vd519,X1),vmul(vd520,X1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_69,plain,
vd518 = vd517,
inference(sr,[status(thm)],[c_0_67,c_0_45]) ).
cnf(c_0_70,plain,
greater(vmul(vd519,X1),vmul(X1,vd520)),
inference(spm,[status(thm)],[c_0_68,c_0_57]) ).
cnf(c_0_71,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd517,vd520)),
inference(spm,[status(thm)],[c_0_20,c_0_69]) ).
cnf(c_0_72,plain,
greater(vmul(X1,vd519),vmul(X1,vd520)),
inference(spm,[status(thm)],[c_0_70,c_0_57]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM856+2 : TPTP v8.2.0. Released v4.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 04:12:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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/benchmark/theBenchmark.p
% 1.61/0.71 # Version: 3.1.0
% 1.61/0.71 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.61/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.61/0.71 # Starting new_bool_3 with 300s (1) cores
% 1.61/0.71 # Starting new_bool_1 with 300s (1) cores
% 1.61/0.71 # Starting sh5l with 300s (1) cores
% 1.61/0.71 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14340 completed with status 0
% 1.61/0.71 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.61/0.71 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.61/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.61/0.71 # No SInE strategy applied
% 1.61/0.71 # Search class: FGHSM-FFMS21-SFFFFFNN
% 1.61/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 1.61/0.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.61/0.71 # Starting new_bool_3 with 136s (1) cores
% 1.61/0.71 # Starting new_bool_1 with 136s (1) cores
% 1.61/0.71 # Starting sh5l with 136s (1) cores
% 1.61/0.71 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 14344 completed with status 0
% 1.61/0.71 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 1.61/0.71 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.61/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.61/0.71 # No SInE strategy applied
% 1.61/0.71 # Search class: FGHSM-FFMS21-SFFFFFNN
% 1.61/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 1.61/0.71 # Preprocessing time : 0.002 s
% 1.61/0.71 # Presaturation interreduction done
% 1.61/0.71
% 1.61/0.71 # Proof found!
% 1.61/0.71 # SZS status Theorem
% 1.61/0.71 # SZS output start CNFRefutation
% See solution above
% 1.61/0.71 # Parsed axioms : 59
% 1.61/0.71 # Removed by relevancy pruning/SinE : 0
% 1.61/0.71 # Initial clauses : 72
% 1.61/0.71 # Removed in clause preprocessing : 3
% 1.61/0.71 # Initial clauses in saturation : 69
% 1.61/0.71 # Processed clauses : 2867
% 1.61/0.71 # ...of these trivial : 105
% 1.61/0.71 # ...subsumed : 2070
% 1.61/0.71 # ...remaining for further processing : 692
% 1.61/0.71 # Other redundant clauses eliminated : 99
% 1.61/0.71 # Clauses deleted for lack of memory : 0
% 1.61/0.71 # Backward-subsumed : 77
% 1.61/0.71 # Backward-rewritten : 12
% 1.61/0.71 # Generated clauses : 14317
% 1.61/0.71 # ...of the previous two non-redundant : 13507
% 1.61/0.71 # ...aggressively subsumed : 0
% 1.61/0.71 # Contextual simplify-reflections : 4
% 1.61/0.71 # Paramodulations : 14204
% 1.61/0.71 # Factorizations : 4
% 1.61/0.71 # NegExts : 0
% 1.61/0.71 # Equation resolutions : 106
% 1.61/0.71 # Disequality decompositions : 0
% 1.61/0.71 # Total rewrite steps : 5722
% 1.61/0.71 # ...of those cached : 4538
% 1.61/0.71 # Propositional unsat checks : 0
% 1.61/0.71 # Propositional check models : 0
% 1.61/0.71 # Propositional check unsatisfiable : 0
% 1.61/0.71 # Propositional clauses : 0
% 1.61/0.71 # Propositional clauses after purity: 0
% 1.61/0.71 # Propositional unsat core size : 0
% 1.61/0.71 # Propositional preprocessing time : 0.000
% 1.61/0.71 # Propositional encoding time : 0.000
% 1.61/0.71 # Propositional solver time : 0.000
% 1.61/0.71 # Success case prop preproc time : 0.000
% 1.61/0.71 # Success case prop encoding time : 0.000
% 1.61/0.71 # Success case prop solver time : 0.000
% 1.61/0.71 # Current number of processed clauses : 533
% 1.61/0.71 # Positive orientable unit clauses : 70
% 1.61/0.71 # Positive unorientable unit clauses: 7
% 1.61/0.71 # Negative unit clauses : 145
% 1.61/0.71 # Non-unit-clauses : 311
% 1.61/0.71 # Current number of unprocessed clauses: 10703
% 1.61/0.71 # ...number of literals in the above : 21989
% 1.61/0.71 # Current number of archived formulas : 0
% 1.61/0.71 # Current number of archived clauses : 151
% 1.61/0.71 # Clause-clause subsumption calls (NU) : 11779
% 1.61/0.71 # Rec. Clause-clause subsumption calls : 9984
% 1.61/0.71 # Non-unit clause-clause subsumptions : 565
% 1.61/0.71 # Unit Clause-clause subsumption calls : 4008
% 1.61/0.71 # Rewrite failures with RHS unbound : 0
% 1.61/0.71 # BW rewrite match attempts : 180
% 1.61/0.71 # BW rewrite match successes : 118
% 1.61/0.71 # Condensation attempts : 0
% 1.61/0.71 # Condensation successes : 0
% 1.61/0.71 # Termbank termtop insertions : 129990
% 1.61/0.71 # Search garbage collected termcells : 773
% 1.61/0.71
% 1.61/0.71 # -------------------------------------------------
% 1.61/0.71 # User time : 0.187 s
% 1.61/0.71 # System time : 0.010 s
% 1.61/0.71 # Total time : 0.197 s
% 1.61/0.71 # Maximum resident set size: 2004 pages
% 1.61/0.71
% 1.61/0.71 # -------------------------------------------------
% 1.61/0.71 # User time : 0.967 s
% 1.61/0.71 # System time : 0.024 s
% 1.61/0.71 # Total time : 0.991 s
% 1.61/0.71 # Maximum resident set size: 1808 pages
% 1.61/0.71 % E---3.1 exiting
% 1.61/0.71 % E exiting
%------------------------------------------------------------------------------