TSTP Solution File: SWV157+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV157+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:56:13 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 84 ( 31 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 80 ( 23 ~; 15 |; 30 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 17 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0007,conjecture,
( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
& leq(n0,pv10)
& leq(n0,pv47)
& leq(pv10,n135299)
& leq(pv47,n4)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv47)) )
=> a_select3(q,pv10,X14) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X14)),minus(a_select2(x,pv10),a_select2(mu,X14))),tptp_minus_2),times(a_select2(sigma,X14),a_select2(sigma,X14)))),a_select2(rho,X14)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X14))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
& ! [X18] :
( ( leq(n0,X18)
& leq(X18,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,pv47) )
=> ( pv47 != X4
=> a_select3(q,pv10,X4) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X4)),minus(a_select2(x,pv10),a_select2(mu,X4))),tptp_minus_2),times(a_select2(sigma,X4),a_select2(sigma,X4)))),a_select2(rho,X4)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X4))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JzRNxykqYR/E---3.1_30688.p',cl5_nebula_norm_0007) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/tmp/tmp.JzRNxykqYR/E---3.1_30688.p',pred_minus_1) ).
fof(succ_pred,axiom,
! [X1] : succ(pred(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.JzRNxykqYR/E---3.1_30688.p',succ_pred) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.JzRNxykqYR/E---3.1_30688.p',leq_gt2) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.JzRNxykqYR/E---3.1_30688.p',leq_succ_gt_equiv) ).
fof(c_0_5,negated_conjecture,
~ ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
& leq(n0,pv10)
& leq(n0,pv47)
& leq(pv10,n135299)
& leq(pv47,n4)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv47)) )
=> a_select3(q,pv10,X14) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X14)),minus(a_select2(x,pv10),a_select2(mu,X14))),tptp_minus_2),times(a_select2(sigma,X14),a_select2(sigma,X14)))),a_select2(rho,X14)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X14))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
& ! [X18] :
( ( leq(n0,X18)
& leq(X18,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,pv47) )
=> ( pv47 != X4
=> a_select3(q,pv10,X4) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X4)),minus(a_select2(x,pv10),a_select2(mu,X4))),tptp_minus_2),times(a_select2(sigma,X4),a_select2(sigma,X4)))),a_select2(rho,X4)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X4))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0007]) ).
fof(c_0_6,negated_conjecture,
! [X28,X29] :
( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
& leq(n0,pv10)
& leq(n0,pv47)
& leq(pv10,n135299)
& leq(pv47,n4)
& ( ~ leq(n0,X28)
| ~ leq(X28,pred(pv47))
| a_select3(q,pv10,X28) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X28)),minus(a_select2(x,pv10),a_select2(mu,X28))),tptp_minus_2),times(a_select2(sigma,X28),a_select2(sigma,X28)))),a_select2(rho,X28)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X28))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
& ( ~ leq(n0,X29)
| ~ leq(X29,pred(pv10))
| sum(n0,n4,a_select3(q,X29,tptp_sum_index)) = n1 )
& leq(n0,esk1_0)
& leq(esk1_0,pv47)
& pv47 != esk1_0
& a_select3(q,pv10,esk1_0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X36] : minus(X36,n1) = pred(X36),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_8,negated_conjecture,
a_select3(q,pv10,esk1_0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( a_select3(q,pv10,X1) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv47)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X62] : succ(pred(X62)) = X62,
inference(variable_rename,[status(thm)],[succ_pred]) ).
fof(c_0_13,plain,
! [X48,X49] :
( ~ leq(X48,X49)
| X48 = X49
| gt(X49,X48) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt2])]) ).
cnf(c_0_14,negated_conjecture,
divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,esk1_0)),minus(a_select2(x,pv10),a_select2(mu,esk1_0))),tptp_minus_2),times(a_select2(sigma,esk1_0),a_select2(sigma,esk1_0)))),a_select2(rho,esk1_0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,esk1_0))),pv84) != a_select3(q,pv10,esk1_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),pv84) = a_select3(q,pv10,X1)
| ~ leq(X1,minus(pv47,n1))
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_17,plain,
! [X52,X53] :
( ( ~ leq(X52,X53)
| gt(succ(X53),X52) )
& ( ~ gt(succ(X53),X52)
| leq(X52,X53) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])]) ).
cnf(c_0_18,plain,
succ(pred(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
leq(esk1_0,pv47),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
pv47 != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
~ leq(esk1_0,minus(pv47,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( leq(X2,X1)
| ~ gt(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
succ(minus(X1,n1)) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,negated_conjecture,
gt(pv47,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV157+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.16/0.34 % Computer : n025.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 2400
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Oct 3 04:11:36 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.JzRNxykqYR/E---3.1_30688.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 30771 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.20/0.52 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.20/0.52 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30777 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.20/0.52 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 100
% 0.20/0.52 # Removed by relevancy pruning/SinE : 23
% 0.20/0.52 # Initial clauses : 90
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 90
% 0.20/0.52 # Processed clauses : 338
% 0.20/0.52 # ...of these trivial : 5
% 0.20/0.52 # ...subsumed : 31
% 0.20/0.52 # ...remaining for further processing : 302
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 1
% 0.20/0.52 # Backward-rewritten : 2
% 0.20/0.52 # Generated clauses : 821
% 0.20/0.52 # ...of the previous two non-redundant : 517
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 808
% 0.20/0.52 # Factorizations : 13
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 489
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 209
% 0.20/0.52 # Positive orientable unit clauses : 92
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 9
% 0.20/0.52 # Non-unit-clauses : 108
% 0.20/0.52 # Current number of unprocessed clauses: 354
% 0.20/0.52 # ...number of literals in the above : 1166
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 93
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 8156
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 2154
% 0.20/0.52 # Non-unit clause-clause subsumptions : 26
% 0.20/0.52 # Unit Clause-clause subsumption calls : 77
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 26
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 13319
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.022 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.029 s
% 0.20/0.52 # Maximum resident set size: 2088 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.026 s
% 0.20/0.52 # System time : 0.008 s
% 0.20/0.52 # Total time : 0.034 s
% 0.20/0.52 # Maximum resident set size: 1804 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------