%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV247-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:00:55 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 48 ( 14 unt; 12 nHn; 40 RR)
% Number of literals : 98 ( 0 equ; 43 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 85 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnE_0) ).
cnf(cls_Message_Oanalz_ODecrypt__dest_0,axiom,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X1)),c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz_ODecrypt__dest_0) ).
cnf(cls_Message_Oanalz_OInj_0,axiom,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz_OInj_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_OKey__synth_0,axiom,
( ~ c_in(c_Message_Omsg_OKey(X1),c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(X1),X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_OKey__synth_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).
cnf(cls_Message_OCrypt__synth_1,axiom,
( ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_OCrypt__synth_1) ).
cnf(c_0_10,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_11,plain,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X1)),c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_ODecrypt__dest_0]) ).
cnf(c_0_12,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz_OInj_0]) ).
cnf(c_0_13,negated_conjecture,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_3 ).
cnf(c_0_17,plain,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X1)),c_Message_Oanalz(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oanalz(X3),tc_Message_Omsg)
| c_in(X2,c_Message_Oanalz(X3),tc_Message_Omsg) ),
c_0_11 ).
cnf(c_0_18,plain,
( ~ c_in(X1,X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_20,negated_conjecture,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg),
c_0_13 ).
cnf(c_0_21,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X3)),X2,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oanalz(X2),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ c_in(c_Message_Omsg_OKey(X1),c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(X1),X2,tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OKey__synth_0]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_in(c_Message_Omsg_OCrypt(v_K,X1),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_30,plain,
( ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_OCrypt__synth_1]) ).
cnf(c_0_31,plain,
( ~ c_in(c_Message_Omsg_OKey(X1),c_Message_Osynth(X2),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(X1),X2,tc_Message_Omsg) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
( c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),v_G,tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_34,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ~ c_in(c_Message_Omsg_OCrypt(v_K,X1),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_36,plain,
( ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Osynth(X3),tc_Message_Omsg)
| c_in(c_Message_Omsg_OCrypt(X1,X2),X3,tc_Message_Omsg)
| c_in(X2,c_Message_Osynth(X3),tc_Message_Omsg) ),
c_0_30 ).
cnf(c_0_37,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(v_K,v_X),c_Message_Osynth(v_G),tc_Message_Omsg),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_39,plain,
( ~ c_in(c_Message_Omsg_OCrypt(X3,X1),X2,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X3)),X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_40,negated_conjecture,
( ~ c_in(c_Message_Omsg_OCrypt(v_K,X1),v_G,tc_Message_Omsg)
| c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_41,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(v_K,v_X),v_G,tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
( ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X4)),X2,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X4,X1),c_union(X2,X3,tc_Message_Omsg),tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_43,negated_conjecture,
c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Osynth(v_G),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]) ).
cnf(c_0_44,plain,
( ~ c_in(c_Message_Omsg_OCrypt(X4,X1),X2,tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OKey(c_Message_OinvKey(X4)),X2,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(X2,X3,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_45,negated_conjecture,
c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),v_G,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ~ c_in(c_Message_Omsg_OCrypt(v_K,X1),v_G,tc_Message_Omsg)
| c_in(X1,c_Message_Oanalz(c_union(v_G,X2,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_46]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV247-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n004.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 08:36:06 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.57 Running first-order theorem proving
% 0.26/0.57 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/benchmark/theBenchmark.p
% 0.26/0.61 % Version: 3.5.1
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % Starting sh5l with 300s (1) cores
% 0.26/0.61 % sh5l with pid 2730321 completed with status 0
% 0.26/0.61 % Result found by sh5l
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % Starting sh5l with 300s (1) cores
% 0.26/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.61 % Search class: FGUNF-FFSF31-MFFFFFNN
% 0.26/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.61 % SubtermCWHack with pid 2730324 completed with status 0
% 0.26/0.61 % Result found by SubtermCWHack
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % Starting sh5l with 300s (1) cores
% 0.26/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.61 % Search class: FGUNF-FFSF31-MFFFFFNN
% 0.26/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.61 % Preprocessing time : 0.001 s
% 0.26/0.61
% 0.26/0.61 % Proof found!
% 0.26/0.61 % SZS status Unsatisfiable
% 0.26/0.61 % SZS output start CNFRefutation
% See solution above
% 0.26/0.61 % Parsed axioms : 10
% 0.26/0.61 % Removed by relevancy pruning/SinE : 0
% 0.26/0.61 % Initial clauses : 10
% 0.26/0.61 % Removed in clause preprocessing : 0
% 0.26/0.61 % Initial clauses in saturation : 10
% 0.26/0.61 % Processed clauses : 62
% 0.26/0.61 % ...of these trivial : 0
% 0.26/0.61 % ...subsumed : 0
% 0.26/0.61 % ...remaining for further processing : 62
% 0.26/0.61 % Other redundant clauses eliminated : 0
% 0.26/0.61 % Clauses deleted for lack of memory : 0
% 0.26/0.61 % Backward-subsumed : 0
% 0.26/0.61 % Backward-rewritten : 10
% 0.26/0.61 % Generated clauses : 257
% 0.26/0.61 % ...of the previous two non-redundant : 240
% 0.26/0.61 % ...aggressively subsumed : 0
% 0.26/0.61 % Contextual simplify-reflections : 1
% 0.26/0.61 % Paramodulations : 257
% 0.26/0.61 % Factorizations : 0
% 0.26/0.61 % NegExts : 0
% 0.26/0.61 % Equation resolutions : 0
% 0.26/0.61 % Disequality decompositions : 0
% 0.26/0.61 % Total rewrite steps : 13
% 0.26/0.61 % ...of those cached : 9
% 0.26/0.61 % Propositional unsat checks : 0
% 0.26/0.61 % Propositional check models : 0
% 0.26/0.61 % Propositional check unsatisfiable : 0
% 0.26/0.61 % Propositional clauses : 0
% 0.26/0.61 % Propositional clauses after purity: 0
% 0.26/0.61 % Propositional unsat core size : 0
% 0.26/0.61 % Propositional preprocessing time : 0.000
% 0.26/0.61 % Propositional encoding time : 0.000
% 0.26/0.61 % Propositional solver time : 0.000
% 0.26/0.61 % Success case prop preproc time : 0.000
% 0.26/0.61 % Success case prop encoding time : 0.000
% 0.26/0.61 % Success case prop solver time : 0.000
% 0.26/0.61 % Current number of processed clauses : 52
% 0.26/0.61 % Positive orientable unit clauses : 9
% 0.26/0.61 % Positive unorientable unit clauses: 0
% 0.26/0.61 % Negative unit clauses : 7
% 0.26/0.61 % Non-unit-clauses : 36
% 0.26/0.61 % Current number of unprocessed clauses: 188
% 0.26/0.61 % ...number of literals in the above : 555
% 0.26/0.61 % Current number of archived formulas : 0
% 0.26/0.61 % Current number of archived clauses : 10
% 0.26/0.61 % Clause-clause subsumption calls (NU) : 297
% 0.26/0.61 % Rec. Clause-clause subsumption calls : 292
% 0.26/0.61 % Non-unit clause-clause subsumptions : 1
% 0.26/0.61 % Unit Clause-clause subsumption calls : 56
% 0.26/0.61 % Rewrite failures with RHS unbound : 0
% 0.26/0.61 % BW rewrite match attempts : 3
% 0.26/0.61 % BW rewrite match successes : 2
% 0.26/0.61 % Condensation attempts : 0
% 0.26/0.61 % Condensation successes : 0
% 0.26/0.61 % Termbank termtop insertions : 6461
% 0.26/0.61 % Search garbage collected termcells : 24
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.009 s
% 0.26/0.61 % System time : 0.003 s
% 0.26/0.61 % Total time : 0.012 s
% 0.26/0.61 % Maximum resident set size: 3640 pages
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.012 s
% 0.26/0.61 % System time : 0.009 s
% 0.26/0.61 % Total time : 0.021 s
% 0.26/0.61 % Maximum resident set size: 4864 pages
% 0.26/0.61 % E exiting
%------------------------------------------------------------------------------