TSTP Solution File: SWV234+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV234+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:43:47 EDT 2023
% Result : Theorem 539.85s 68.54s
% Output : CNFRefutation 539.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 67 ( 40 unt; 0 def)
% Number of atoms : 136 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 127 ( 58 ~; 56 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xor_commutative,axiom,
! [X1,X2] : xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',xor_commutative) ).
fof(xor_associative,axiom,
! [X1,X2,X3] : xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',xor_associative) ).
fof(xor_rules_2,axiom,
! [X1] : xor(X1,X1) = id,
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',xor_rules_2) ).
fof(xor_rules_1,axiom,
! [X1] : xor(X1,id) = X1,
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',xor_rules_1) ).
fof(key_part_import___part_2,axiom,
! [X6,X9,X11] :
( ( p(X6)
& p(crypt(xor(km,xor(kp,X9)),X11))
& p(X9) )
=> p(crypt(xor(km,xor(X9,kp)),xor(X6,X11))) ),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',key_part_import___part_2) ).
fof(encrypt_data,axiom,
! [X1,X6] :
( ( p(X1)
& p(crypt(xor(km,data),X6)) )
=> p(crypt(X6,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',encrypt_data) ).
fof(key_import,axiom,
! [X4,X5,X6,X7,X8] :
( ( p(crypt(xor(X4,X5),X6))
& p(X7)
& p(crypt(xor(km,imp),X8)) )
=> p(crypt(xor(km,X7),decrypt(xor(X8,X7),crypt(xor(X4,X5),X6)))) ),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',key_import) ).
fof(key_part_import___part_3,axiom,
! [X6,X9,X11] :
( ( p(X6)
& p(crypt(xor(km,xor(X9,kp)),X11))
& p(X9) )
=> p(crypt(xor(km,X9),xor(X11,X6))) ),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',key_part_import___part_3) ).
fof(partially_completed_key,axiom,
p(crypt(xor(km,xor(kp,imp)),xor(kek,k3))),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',partially_completed_key) ).
fof(inital_knowledge_of_intruder_3,axiom,
p(data),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',inital_knowledge_of_intruder_3) ).
fof(inital_knowledge_of_intruder_2,axiom,
p(imp),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',inital_knowledge_of_intruder_2) ).
fof(key_part,axiom,
p(k3),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',key_part) ).
fof(encryption_decryption_cancellation,axiom,
! [X1,X2] : decrypt(X1,crypt(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',encryption_decryption_cancellation) ).
fof(combine_with_XOR,axiom,
! [X1,X2] :
( ( p(X1)
& p(X2) )
=> p(xor(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',combine_with_XOR) ).
fof(find_pin,conjecture,
p(crypt(pp,a)),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',find_pin) ).
fof(pin_key_encrypted_for_transfer,axiom,
p(crypt(xor(kek,pin),pp)),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',pin_key_encrypted_for_transfer) ).
fof(inital_knowledge_of_intruder_5,axiom,
p(pin),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',inital_knowledge_of_intruder_5) ).
fof(an_account_number,axiom,
p(a),
file('/export/starexec/sandbox/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p',an_account_number) ).
fof(c_0_18,plain,
! [X37,X38] : xor(X37,X38) = xor(X38,X37),
inference(variable_rename,[status(thm)],[xor_commutative]) ).
fof(c_0_19,plain,
! [X39,X40,X41] : xor(X39,xor(X40,X41)) = xor(xor(X39,X40),X41),
inference(variable_rename,[status(thm)],[xor_associative]) ).
cnf(c_0_20,plain,
xor(X1,X2) = xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X43] : xor(X43,X43) = id,
inference(variable_rename,[status(thm)],[xor_rules_2]) ).
fof(c_0_23,plain,
! [X42] : xor(X42,id) = X42,
inference(variable_rename,[status(thm)],[xor_rules_1]) ).
fof(c_0_24,plain,
! [X14,X15,X16] :
( ~ p(X14)
| ~ p(crypt(xor(km,xor(kp,X15)),X16))
| ~ p(X15)
| p(crypt(xor(km,xor(X15,kp)),xor(X14,X16))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_part_import___part_2])]) ).
cnf(c_0_25,plain,
xor(X1,xor(X2,X3)) = xor(X3,xor(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
xor(X1,X1) = id,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
xor(X1,id) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_28,plain,
! [X33,X34] :
( ~ p(X33)
| ~ p(crypt(xor(km,data),X34))
| p(crypt(X34,X33)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_data])]) ).
fof(c_0_29,plain,
! [X28,X29,X30,X31,X32] :
( ~ p(crypt(xor(X28,X29),X30))
| ~ p(X31)
| ~ p(crypt(xor(km,imp),X32))
| p(crypt(xor(km,X31),decrypt(xor(X32,X31),crypt(xor(X28,X29),X30)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_import])]) ).
fof(c_0_30,plain,
! [X17,X18,X19] :
( ~ p(X17)
| ~ p(crypt(xor(km,xor(X18,kp)),X19))
| ~ p(X18)
| p(crypt(xor(km,X18),xor(X19,X17))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_part_import___part_3])]) ).
cnf(c_0_31,plain,
( p(crypt(xor(km,xor(X2,kp)),xor(X1,X3)))
| ~ p(X1)
| ~ p(crypt(xor(km,xor(kp,X2)),X3))
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
p(crypt(xor(km,xor(kp,imp)),xor(kek,k3))),
inference(split_conjunct,[status(thm)],[partially_completed_key]) ).
cnf(c_0_34,plain,
( p(crypt(X2,X1))
| ~ p(X1)
| ~ p(crypt(xor(km,data),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( p(crypt(xor(km,X4),decrypt(xor(X5,X4),crypt(xor(X1,X2),X3))))
| ~ p(crypt(xor(X1,X2),X3))
| ~ p(X4)
| ~ p(crypt(xor(km,imp),X5)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
p(data),
inference(split_conjunct,[status(thm)],[inital_knowledge_of_intruder_3]) ).
cnf(c_0_37,plain,
( p(crypt(xor(km,X2),xor(X3,X1)))
| ~ p(X1)
| ~ p(crypt(xor(km,xor(X2,kp)),X3))
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( p(crypt(xor(km,xor(X1,kp)),X2))
| ~ p(crypt(xor(km,xor(kp,X1)),xor(X3,X2)))
| ~ p(X1)
| ~ p(X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
p(crypt(xor(km,xor(kp,imp)),xor(k3,kek))),
inference(rw,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_40,plain,
p(imp),
inference(split_conjunct,[status(thm)],[inital_knowledge_of_intruder_2]) ).
cnf(c_0_41,plain,
p(k3),
inference(split_conjunct,[status(thm)],[key_part]) ).
cnf(c_0_42,plain,
( p(crypt(decrypt(xor(X1,data),crypt(xor(X2,X3),X4)),X5))
| ~ p(crypt(xor(km,imp),X1))
| ~ p(crypt(xor(X2,X3),X4))
| ~ p(X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
fof(c_0_44,plain,
! [X26,X27] : decrypt(X26,crypt(X26,X27)) = X27,
inference(variable_rename,[status(thm)],[encryption_decryption_cancellation]) ).
cnf(c_0_45,plain,
( p(crypt(xor(km,X1),xor(X2,X3)))
| ~ p(crypt(xor(km,xor(kp,X1)),X2))
| ~ p(X1)
| ~ p(X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_46,plain,
p(crypt(xor(km,xor(kp,imp)),kek)),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]),c_0_20]) ).
cnf(c_0_47,plain,
( p(crypt(decrypt(xor(X1,data),crypt(X2,X3)),X4))
| ~ p(crypt(xor(km,imp),X1))
| ~ p(crypt(X2,X3))
| ~ p(X4) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
decrypt(X1,crypt(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( p(crypt(xor(km,imp),xor(kek,X1)))
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_40])]) ).
cnf(c_0_50,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(km,imp),X3))
| ~ p(crypt(xor(X3,data),X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( p(crypt(xor(km,imp),X1))
| ~ p(xor(kek,X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_52,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(X3,data),X1))
| ~ p(xor(kek,X3))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(data,X3),X1))
| ~ p(xor(kek,X3))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
cnf(c_0_54,plain,
xor(X1,xor(X2,X3)) = xor(X2,xor(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_21]) ).
fof(c_0_55,plain,
! [X20,X21] :
( ~ p(X20)
| ~ p(X21)
| p(xor(X20,X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[combine_with_XOR])]) ).
cnf(c_0_56,plain,
( p(crypt(X1,X2))
| ~ p(xor(data,xor(kek,X3)))
| ~ p(crypt(X3,X1))
| ~ p(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_32]),c_0_54]) ).
cnf(c_0_57,plain,
( p(xor(X1,X2))
| ~ p(X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
fof(c_0_58,negated_conjecture,
~ p(crypt(pp,a)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[find_pin])]) ).
cnf(c_0_59,plain,
( p(crypt(X1,X2))
| ~ p(xor(kek,X3))
| ~ p(crypt(X3,X1))
| ~ p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_36])]) ).
cnf(c_0_60,plain,
p(crypt(xor(kek,pin),pp)),
inference(split_conjunct,[status(thm)],[pin_key_encrypted_for_transfer]) ).
cnf(c_0_61,plain,
xor(X1,xor(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_62,plain,
p(pin),
inference(split_conjunct,[status(thm)],[inital_knowledge_of_intruder_5]) ).
cnf(c_0_63,negated_conjecture,
~ p(crypt(pp,a)),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,plain,
( p(crypt(pp,X1))
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_20]),c_0_61]),c_0_62])]) ).
cnf(c_0_65,plain,
p(a),
inference(split_conjunct,[status(thm)],[an_account_number]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV234+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n016.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 04:08:07 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/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/tmp/tmp.0Ifq48GvVs/E---3.1_3109.p
% 539.85/68.54 # Version: 3.1pre001
% 539.85/68.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 539.85/68.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 539.85/68.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 539.85/68.54 # Starting new_bool_3 with 300s (1) cores
% 539.85/68.54 # Starting new_bool_1 with 300s (1) cores
% 539.85/68.54 # Starting sh5l with 300s (1) cores
% 539.85/68.54 # sh5l with pid 3222 completed with status 0
% 539.85/68.54 # Result found by sh5l
% 539.85/68.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 539.85/68.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 539.85/68.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 539.85/68.54 # Starting new_bool_3 with 300s (1) cores
% 539.85/68.54 # Starting new_bool_1 with 300s (1) cores
% 539.85/68.54 # Starting sh5l with 300s (1) cores
% 539.85/68.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 539.85/68.54 # Search class: FHUSM-FFMM22-MFFFFFNN
% 539.85/68.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 539.85/68.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 539.85/68.54 # SAT001_MinMin_p005000_rr_RG with pid 3230 completed with status 0
% 539.85/68.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 539.85/68.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 539.85/68.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 539.85/68.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 539.85/68.54 # Starting new_bool_3 with 300s (1) cores
% 539.85/68.54 # Starting new_bool_1 with 300s (1) cores
% 539.85/68.54 # Starting sh5l with 300s (1) cores
% 539.85/68.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 539.85/68.54 # Search class: FHUSM-FFMM22-MFFFFFNN
% 539.85/68.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 539.85/68.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 539.85/68.54 # Preprocessing time : 0.002 s
% 539.85/68.54 # Presaturation interreduction done
% 539.85/68.54
% 539.85/68.54 # Proof found!
% 539.85/68.54 # SZS status Theorem
% 539.85/68.54 # SZS output start CNFRefutation
% See solution above
% 539.85/68.54 # Parsed axioms : 26
% 539.85/68.54 # Removed by relevancy pruning/SinE : 0
% 539.85/68.54 # Initial clauses : 26
% 539.85/68.54 # Removed in clause preprocessing : 0
% 539.85/68.54 # Initial clauses in saturation : 26
% 539.85/68.54 # Processed clauses : 161681
% 539.85/68.54 # ...of these trivial : 87
% 539.85/68.54 # ...subsumed : 152741
% 539.85/68.54 # ...remaining for further processing : 8853
% 539.85/68.54 # Other redundant clauses eliminated : 0
% 539.85/68.54 # Clauses deleted for lack of memory : 0
% 539.85/68.54 # Backward-subsumed : 322
% 539.85/68.54 # Backward-rewritten : 6
% 539.85/68.54 # Generated clauses : 1942658
% 539.85/68.54 # ...of the previous two non-redundant : 1907629
% 539.85/68.54 # ...aggressively subsumed : 0
% 539.85/68.54 # Contextual simplify-reflections : 121
% 539.85/68.54 # Paramodulations : 1942658
% 539.85/68.54 # Factorizations : 0
% 539.85/68.54 # NegExts : 0
% 539.85/68.54 # Equation resolutions : 0
% 539.85/68.54 # Total rewrite steps : 3064021
% 539.85/68.54 # Propositional unsat checks : 1
% 539.85/68.54 # Propositional check models : 1
% 539.85/68.54 # Propositional check unsatisfiable : 0
% 539.85/68.54 # Propositional clauses : 0
% 539.85/68.54 # Propositional clauses after purity: 0
% 539.85/68.54 # Propositional unsat core size : 0
% 539.85/68.54 # Propositional preprocessing time : 0.000
% 539.85/68.54 # Propositional encoding time : 0.512
% 539.85/68.54 # Propositional solver time : 0.062
% 539.85/68.54 # Success case prop preproc time : 0.000
% 539.85/68.54 # Success case prop encoding time : 0.000
% 539.85/68.54 # Success case prop solver time : 0.000
% 539.85/68.54 # Current number of processed clauses : 8499
% 539.85/68.54 # Positive orientable unit clauses : 29
% 539.85/68.54 # Positive unorientable unit clauses: 4
% 539.85/68.54 # Negative unit clauses : 18
% 539.85/68.54 # Non-unit-clauses : 8448
% 539.85/68.54 # Current number of unprocessed clauses: 1741228
% 539.85/68.54 # ...number of literals in the above : 12072836
% 539.85/68.54 # Current number of archived formulas : 0
% 539.85/68.54 # Current number of archived clauses : 354
% 539.85/68.54 # Clause-clause subsumption calls (NU) : 84229315
% 539.85/68.54 # Rec. Clause-clause subsumption calls : 8121861
% 539.85/68.54 # Non-unit clause-clause subsumptions : 127926
% 539.85/68.54 # Unit Clause-clause subsumption calls : 27464
% 539.85/68.54 # Rewrite failures with RHS unbound : 0
% 539.85/68.54 # BW rewrite match attempts : 289
% 539.85/68.54 # BW rewrite match successes : 68
% 539.85/68.54 # Condensation attempts : 0
% 539.85/68.54 # Condensation successes : 0
% 539.85/68.54 # Termbank termtop insertions : 63346480
% 539.85/68.54
% 539.85/68.54 # -------------------------------------------------
% 539.85/68.54 # User time : 66.204 s
% 539.85/68.54 # System time : 1.158 s
% 539.85/68.54 # Total time : 67.362 s
% 539.85/68.54 # Maximum resident set size: 1840 pages
% 539.85/68.54
% 539.85/68.54 # -------------------------------------------------
% 539.85/68.54 # User time : 66.210 s
% 539.85/68.54 # System time : 1.158 s
% 539.85/68.54 # Total time : 67.368 s
% 539.85/68.54 # Maximum resident set size: 1708 pages
% 539.85/68.54 % E---3.1 exiting
% 539.85/68.54 % E---3.1 exiting
%------------------------------------------------------------------------------