TSTP Solution File: GEO273+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO273+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 17:32:28 EDT 2023
% Result : Theorem 2.95s 0.87s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 19 unt; 0 def)
% Number of atoms : 140 ( 92 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 172 ( 68 ~; 72 |; 20 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-8 aty)
% Number of variables : 74 ( 0 sgn; 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qe(222)',conjecture,
? [X1] :
( vf(vd1069,vd1070) = vf(vd1074,X1)
& rpoint(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','qe(222)') ).
fof('ass(cond(proof(223), 0), 0)',axiom,
! [X4,X5] :
( ( X4 != X5
& ? [X6] :
( X5 = X6
& rpoint(X6) )
& ? [X7] :
( X4 = X7
& rpoint(X7) ) )
=> ! [X8,X9] :
( ( X8 = X9
& X8 != X5
& X8 != X4
& rpoint(X9) )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> vf(X4,X5) = vf(X8,vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','ass(cond(proof(223), 0), 0)') ).
fof('pred(221, 1)',axiom,
rpoint(vd1075),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','pred(221, 1)') ).
fof('pred(221, 4)',axiom,
vd1074 = vd1075,
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','pred(221, 4)') ).
fof('qe(s1(plural(220)))',axiom,
? [X3] :
( vd1069 = X3
& rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','qe(s1(plural(220)))') ).
fof('qe(s2(plural(220)))',axiom,
? [X2] :
( vd1070 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','qe(s2(plural(220)))') ).
fof('ass(cond(proof(223), 0), 7)',axiom,
! [X4,X5] :
( ( X4 != X5
& ? [X6] :
( X5 = X6
& rpoint(X6) )
& ? [X7] :
( X4 = X7
& rpoint(X7) ) )
=> ! [X8,X9] :
( ( X8 = X9
& X8 != X5
& X8 != X4
& rpoint(X9) )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> rpoint(vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','ass(cond(proof(223), 0), 7)') ).
fof('holds(conjunct2(221), 1077, 0)',axiom,
vd1074 != vd1070,
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','holds(conjunct2(221), 1077, 0)') ).
fof('holds(conjunct1(221), 1076, 0)',axiom,
vd1074 != vd1069,
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','holds(conjunct1(221), 1076, 0)') ).
fof('pred(220, 5)',axiom,
vd1069 != vd1070,
file('/export/starexec/sandbox2/tmp/tmp.6az6m3pDvR/E---3.1_31159.p','pred(220, 5)') ).
fof(c_0_10,negated_conjecture,
~ ? [X1] :
( vf(vd1069,vd1070) = vf(vd1074,X1)
& rpoint(X1) ),
inference(assume_negation,[status(cth)],['qe(222)']) ).
fof(c_0_11,plain,
! [X748,X749,X750,X751,X752,X753,X754,X755,X756,X757] :
( X748 = X749
| X749 != X750
| ~ rpoint(X750)
| X748 != X751
| ~ rpoint(X751)
| X752 != X753
| X752 = X749
| X752 = X748
| ~ rpoint(X753)
| X754 != vskolem1092(X752,X753,X748,X749)
| X755 != vskolem1095(X754,X752,X753,X748,X749)
| X756 != vskolem1099(X755,X754,X752,X753,X748,X749)
| X757 != vskolem1102(X756,X755,X754,X752,X753,X748,X749)
| vf(X748,X749) = vf(X752,vskolem1103(X757,X756,X755,X754,X752,X753,X748,X749)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(223), 0), 0)'])])]) ).
fof(c_0_12,negated_conjecture,
! [X745] :
( vf(vd1069,vd1070) != vf(vd1074,X745)
| ~ rpoint(X745) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,plain,
( X1 = X2
| X5 = X2
| X5 = X1
| vf(X1,X2) = vf(X5,vskolem1103(X10,X9,X8,X7,X5,X6,X1,X2))
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4)
| X5 != X6
| ~ rpoint(X6)
| X7 != vskolem1092(X5,X6,X1,X2)
| X8 != vskolem1095(X7,X5,X6,X1,X2)
| X9 != vskolem1099(X8,X7,X5,X6,X1,X2)
| X10 != vskolem1102(X9,X8,X7,X5,X6,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
rpoint(vd1075),
inference(split_conjunct,[status(thm)],['pred(221, 1)']) ).
cnf(c_0_15,plain,
vd1074 = vd1075,
inference(split_conjunct,[status(thm)],['pred(221, 4)']) ).
fof(c_0_16,plain,
( vd1069 = esk2_0
& rpoint(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(220)))'])]) ).
fof(c_0_17,plain,
( vd1070 = esk1_0
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(220)))'])]) ).
cnf(c_0_18,negated_conjecture,
( vf(vd1069,vd1070) != vf(vd1074,X1)
| ~ rpoint(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( vf(X1,vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1099(vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3)) = vf(X2,X3)
| X3 = X1
| X2 = X1
| X2 = X3
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])])])])])])]) ).
cnf(c_0_20,plain,
rpoint(vd1074),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
vd1069 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
vd1070 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X818,X819,X820,X821,X822,X823,X824,X825,X826,X827] :
( X818 = X819
| X819 != X820
| ~ rpoint(X820)
| X818 != X821
| ~ rpoint(X821)
| X822 != X823
| X822 = X819
| X822 = X818
| ~ rpoint(X823)
| X824 != vskolem1092(X822,X823,X818,X819)
| X825 != vskolem1095(X824,X822,X823,X818,X819)
| X826 != vskolem1099(X825,X824,X822,X823,X818,X819)
| X827 != vskolem1102(X826,X825,X824,X822,X823,X818,X819)
| rpoint(vskolem1103(X827,X826,X825,X824,X822,X823,X818,X819)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(223), 0), 7)'])])]) ).
cnf(c_0_26,negated_conjecture,
( X1 = vd1074
| X2 = vd1074
| X2 = X1
| vf(vd1069,vd1070) != vf(X2,X1)
| ~ rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1))
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,plain,
rpoint(vd1069),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
rpoint(vd1070),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
vd1074 != vd1070,
inference(split_conjunct,[status(thm)],['holds(conjunct2(221), 1077, 0)']) ).
cnf(c_0_30,plain,
vd1074 != vd1069,
inference(split_conjunct,[status(thm)],['holds(conjunct1(221), 1076, 0)']) ).
cnf(c_0_31,plain,
vd1069 != vd1070,
inference(split_conjunct,[status(thm)],['pred(220, 5)']) ).
cnf(c_0_32,plain,
( X1 = X2
| X5 = X2
| X5 = X1
| rpoint(vskolem1103(X10,X9,X8,X7,X5,X6,X1,X2))
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4)
| X5 != X6
| ~ rpoint(X6)
| X7 != vskolem1092(X5,X6,X1,X2)
| X8 != vskolem1095(X7,X5,X6,X1,X2)
| X9 != vskolem1099(X8,X7,X5,X6,X1,X2)
| X10 != vskolem1102(X9,X8,X7,X5,X6,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
~ rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]),c_0_28])]),c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1099(vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1))
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_32])])])])])])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_27]),c_0_28])]),c_0_31]),c_0_30]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : GEO273+1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 06:11:59 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.6az6m3pDvR/E---3.1_31159.p
% 2.95/0.87 # Version: 3.1pre001
% 2.95/0.87 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.95/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/0.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.95/0.87 # Starting new_bool_3 with 300s (1) cores
% 2.95/0.87 # Starting new_bool_1 with 300s (1) cores
% 2.95/0.87 # Starting sh5l with 300s (1) cores
% 2.95/0.87 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31238 completed with status 0
% 2.95/0.87 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.95/0.87 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.95/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/0.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.95/0.87 # No SInE strategy applied
% 2.95/0.87 # Search class: FGHSF-FSLM33-SFFFFFNN
% 2.95/0.87 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.95/0.87 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 2.95/0.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.95/0.87 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.95/0.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.95/0.87 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 2.95/0.87 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 31247 completed with status 0
% 2.95/0.87 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.95/0.87 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.95/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/0.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.95/0.87 # No SInE strategy applied
% 2.95/0.87 # Search class: FGHSF-FSLM33-SFFFFFNN
% 2.95/0.87 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.95/0.87 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 2.95/0.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.95/0.87 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.95/0.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.95/0.87 # Preprocessing time : 0.017 s
% 2.95/0.87 # Presaturation interreduction done
% 2.95/0.87
% 2.95/0.87 # Proof found!
% 2.95/0.87 # SZS status Theorem
% 2.95/0.87 # SZS output start CNFRefutation
% See solution above
% 2.95/0.87 # Parsed axioms : 136
% 2.95/0.87 # Removed by relevancy pruning/SinE : 0
% 2.95/0.87 # Initial clauses : 292
% 2.95/0.87 # Removed in clause preprocessing : 2
% 2.95/0.87 # Initial clauses in saturation : 290
% 2.95/0.87 # Processed clauses : 1277
% 2.95/0.87 # ...of these trivial : 20
% 2.95/0.87 # ...subsumed : 327
% 2.95/0.87 # ...remaining for further processing : 930
% 2.95/0.87 # Other redundant clauses eliminated : 1266
% 2.95/0.87 # Clauses deleted for lack of memory : 0
% 2.95/0.87 # Backward-subsumed : 0
% 2.95/0.87 # Backward-rewritten : 0
% 2.95/0.87 # Generated clauses : 1840
% 2.95/0.87 # ...of the previous two non-redundant : 1777
% 2.95/0.87 # ...aggressively subsumed : 0
% 2.95/0.87 # Contextual simplify-reflections : 42
% 2.95/0.87 # Paramodulations : 1549
% 2.95/0.87 # Factorizations : 8
% 2.95/0.87 # NegExts : 0
% 2.95/0.87 # Equation resolutions : 1271
% 2.95/0.87 # Total rewrite steps : 83
% 2.95/0.87 # Propositional unsat checks : 0
% 2.95/0.87 # Propositional check models : 0
% 2.95/0.87 # Propositional check unsatisfiable : 0
% 2.95/0.87 # Propositional clauses : 0
% 2.95/0.87 # Propositional clauses after purity: 0
% 2.95/0.87 # Propositional unsat core size : 0
% 2.95/0.87 # Propositional preprocessing time : 0.000
% 2.95/0.87 # Propositional encoding time : 0.000
% 2.95/0.87 # Propositional solver time : 0.000
% 2.95/0.87 # Success case prop preproc time : 0.000
% 2.95/0.87 # Success case prop encoding time : 0.000
% 2.95/0.87 # Success case prop solver time : 0.000
% 2.95/0.87 # Current number of processed clauses : 370
% 2.95/0.87 # Positive orientable unit clauses : 9
% 2.95/0.87 # Positive unorientable unit clauses: 0
% 2.95/0.87 # Negative unit clauses : 7
% 2.95/0.87 # Non-unit-clauses : 354
% 2.95/0.87 # Current number of unprocessed clauses: 1078
% 2.95/0.87 # ...number of literals in the above : 14556
% 2.95/0.87 # Current number of archived formulas : 0
% 2.95/0.87 # Current number of archived clauses : 288
% 2.95/0.87 # Clause-clause subsumption calls (NU) : 326791
% 2.95/0.87 # Rec. Clause-clause subsumption calls : 9792
% 2.95/0.87 # Non-unit clause-clause subsumptions : 369
% 2.95/0.87 # Unit Clause-clause subsumption calls : 11
% 2.95/0.87 # Rewrite failures with RHS unbound : 0
% 2.95/0.87 # BW rewrite match attempts : 0
% 2.95/0.87 # BW rewrite match successes : 0
% 2.95/0.87 # Condensation attempts : 0
% 2.95/0.87 # Condensation successes : 0
% 2.95/0.87 # Termbank termtop insertions : 122701
% 2.95/0.87
% 2.95/0.87 # -------------------------------------------------
% 2.95/0.87 # User time : 0.352 s
% 2.95/0.87 # System time : 0.010 s
% 2.95/0.87 # Total time : 0.362 s
% 2.95/0.87 # Maximum resident set size: 4596 pages
% 2.95/0.87
% 2.95/0.87 # -------------------------------------------------
% 2.95/0.87 # User time : 1.643 s
% 2.95/0.87 # System time : 0.039 s
% 2.95/0.87 # Total time : 1.682 s
% 2.95/0.87 # Maximum resident set size: 2564 pages
% 2.95/0.87 % E---3.1 exiting
% 2.95/0.87 % E---3.1 exiting
%------------------------------------------------------------------------------