TSTP Solution File: SWV102+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWV102+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% 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 : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 16:59:52 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 32 unt; 0 def)
% Number of atoms : 164 ( 144 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 165 ( 51 ~; 45 |; 64 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-3 aty)
% Number of variables : 47 ( 3 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0014,conjecture,
( ( a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use )
=> ( a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use ) ),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',quaternion_ds1_inuse_0014) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( X5 != X7
& a_select2(X1,X7) = X17 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',sel2_update_2) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',sel2_update_1) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',irreflexivity_gt) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',leq_succ_gt) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',gt_2_0) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',successor_1) ).
fof(gt_2_1,axiom,
gt(n2,n1),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',gt_2_1) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p',reflexivity_leq) ).
fof(c_0_9,negated_conjecture,
~ ( ( a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use )
=> ( a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0014]) ).
fof(c_0_10,negated_conjecture,
( a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& ( a_select2(sigma_defuse,n0) != use
| a_select2(sigma_defuse,n1) != use
| a_select2(sigma_defuse,n2) != use
| a_select2(sigma_defuse,n3) != use
| a_select2(sigma_defuse,n4) != use
| a_select2(sigma_defuse,n5) != use
| a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(xinit_defuse,n3) != use
| a_select2(xinit_defuse,n4) != use
| a_select2(xinit_defuse,n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_11,plain,
! [X5,X7,X1,X17,X25] :
( ( X5 != X7
& a_select2(X1,X7) = X17 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
cnf(c_0_12,negated_conjecture,
( a_select2(sigma_defuse,n0) != use
| a_select2(sigma_defuse,n1) != use
| a_select2(sigma_defuse,n2) != use
| a_select2(sigma_defuse,n3) != use
| a_select2(sigma_defuse,n4) != use
| a_select2(sigma_defuse,n5) != use
| a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(xinit_defuse,n3) != use
| a_select2(xinit_defuse,n4) != use
| a_select2(xinit_defuse,n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
a_select2(sigma_defuse,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
a_select2(sigma_defuse,n1) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
a_select2(sigma_defuse,n2) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
a_select2(sigma_defuse,n3) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
a_select2(sigma_defuse,n4) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
a_select2(sigma_defuse,n5) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
a_select2(xinit_defuse,n3) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
a_select2(xinit_defuse,n4) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
a_select2(xinit_defuse,n5) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X28,X29,X30] : a_select2(tptp_update2(X28,X29,X30),X29) = X30,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_26,plain,
! [X31,X32,X33,X34,X35] :
( X31 = X32
| a_select2(X33,X32) != X34
| a_select2(tptp_update2(X33,X31,X35),X32) = X34 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_27,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( X1 = X2
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| a_select2(X3,X2) != X4 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_33,negated_conjecture,
( n2 = n0
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n0) != use ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_34,plain,
! [X79] : ~ gt(X79,X79),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_32])]) ).
fof(c_0_35,plain,
! [X69,X70] :
( ~ leq(succ(X69),X70)
| gt(X70,X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])])]) ).
cnf(c_0_36,negated_conjecture,
( n2 = n1
| n2 = n0
| a_select2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_28])]) ).
cnf(c_0_37,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[gt_2_0]) ).
cnf(c_0_40,negated_conjecture,
( n0 = n1
| n2 = n0
| n2 = n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_28])]) ).
cnf(c_0_41,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_43,plain,
gt(n2,n1),
inference(split_conjunct,[status(thm)],[gt_2_1]) ).
cnf(c_0_44,negated_conjecture,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]) ).
fof(c_0_45,plain,
! [X55] : leq(X55,X55),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_46,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37]) ).
cnf(c_0_48,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV102+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.06/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n022.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 18:44:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.0d1Zo1LMbV/E---3.1_3171.p
% 0.21/0.54 # Version: 3.2.0
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 3330 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.54 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 3339 completed with status 0
% 0.21/0.54 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 85
% 0.21/0.54 # Removed by relevancy pruning/SinE : 26
% 0.21/0.54 # Initial clauses : 75
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 75
% 0.21/0.54 # Processed clauses : 636
% 0.21/0.54 # ...of these trivial : 1
% 0.21/0.54 # ...subsumed : 344
% 0.21/0.54 # ...remaining for further processing : 291
% 0.21/0.54 # Other redundant clauses eliminated : 2
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 1
% 0.21/0.54 # Backward-rewritten : 72
% 0.21/0.54 # Generated clauses : 1750
% 0.21/0.54 # ...of the previous two non-redundant : 1273
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 1735
% 0.21/0.54 # Factorizations : 3
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 12
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 1017
% 0.21/0.54 # ...of those cached : 928
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 218
% 0.21/0.54 # Positive orientable unit clauses : 68
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 56
% 0.21/0.54 # Non-unit-clauses : 94
% 0.21/0.54 # Current number of unprocessed clauses: 696
% 0.21/0.54 # ...number of literals in the above : 1992
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 73
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 2324
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1903
% 0.21/0.54 # Non-unit clause-clause subsumptions : 31
% 0.21/0.54 # Unit Clause-clause subsumption calls : 330
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 6
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 19015
% 0.21/0.54 # Search garbage collected termcells : 735
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.030 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.035 s
% 0.21/0.54 # Maximum resident set size: 2016 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.032 s
% 0.21/0.54 # System time : 0.008 s
% 0.21/0.54 # Total time : 0.040 s
% 0.21/0.54 # Maximum resident set size: 1792 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------