%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV235+1 : 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 : n003.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 02:54:01 PM UTC 2026
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 54 ( 34 unt; 0 def)
% Number of atoms : 94 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 75 ( 35 ~; 29 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xor_commutative,axiom,
! [X1,X2] : xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutative) ).
fof(xor_associative,axiom,
! [X1,X2,X3] : xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_associative) ).
fof(xor_rules_2,axiom,
! [X1] : xor(X1,X1) = id,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_2) ).
fof(xor_rules_1,axiom,
! [X1] : xor(X1,id) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_1) ).
fof(key_part_import___part_1,axiom,
! [X10,X9] :
( ( p(X9)
& p(X10) )
=> p(crypt(xor(km,xor(kp,X9)),X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_part_import___part_1) ).
fof(find_pin,conjecture,
p(crypt(pp,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_pin) ).
fof(key_export,axiom,
! [X9,X6,X4] :
( ( p(crypt(xor(km,exp),X4))
& p(X9)
& p(crypt(xor(km,X9),X6)) )
=> p(crypt(xor(X4,X9),X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_export) ).
fof(combine_with_XOR,axiom,
! [X1,X2] :
( ( p(X2)
& p(X1) )
=> p(xor(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',combine_with_XOR) ).
fof(initial_knowledge_of_intruder_6,axiom,
p(crypt(xor(km,pin),pp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_6) ).
fof(initial_knowledge_of_intruder_5,axiom,
p(pin),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_5) ).
fof(initial_knowledge_of_intruder_1,axiom,
p(kp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_1) ).
fof(encrypt_knowledge,axiom,
! [X1,X2] :
( ( p(X1)
& p(X2) )
=> p(crypt(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_knowledge) ).
fof(decrypt_knowledge,axiom,
! [X1,X2] :
( ( p(X1)
& p(crypt(X1,X2)) )
=> p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',decrypt_knowledge) ).
fof(initial_knowledge_of_intruder_11,axiom,
p(exp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_11) ).
fof(an_account_number,axiom,
p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_account_number) ).
fof(initial_knowledge_of_intruder_4,axiom,
p(id),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_4) ).
fof(c_0_16,plain,
! [X12,X13] : xor(X12,X13) = xor(X13,X12),
inference(variable_rename,[status(thm)],[xor_commutative]) ).
fof(c_0_17,plain,
! [X14,X15,X16] : xor(X14,xor(X15,X16)) = xor(xor(X14,X15),X16),
inference(variable_rename,[status(thm)],[xor_associative]) ).
cnf(c_0_18,plain,
xor(X1,X2) = xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X20] : xor(X20,X20) = id,
inference(variable_rename,[status(thm)],[xor_rules_2]) ).
fof(c_0_21,plain,
! [X19] : xor(X19,id) = X19,
inference(variable_rename,[status(thm)],[xor_rules_1]) ).
fof(c_0_22,plain,
! [X29,X30] :
( p(crypt(xor(km,xor(kp,X30)),X29))
| ~ p(X30)
| ~ p(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_part_import___part_1])])]) ).
cnf(c_0_23,plain,
xor(X1,xor(X2,X3)) = xor(X3,xor(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
xor(X1,X1) = id,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
xor(X1,id) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,negated_conjecture,
~ p(crypt(pp,a)),
inference(assume_negation,[status(cth)],[find_pin]) ).
fof(c_0_27,plain,
! [X26,X27,X28] :
( p(crypt(xor(X28,X26),X27))
| ~ p(crypt(xor(km,exp),X28))
| ~ p(X26)
| ~ p(crypt(xor(km,X26),X27)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_export])])]) ).
cnf(c_0_28,plain,
( ~ p(X2)
| ~ p(X1)
| p(crypt(xor(km,xor(kp,X2)),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
fof(c_0_30,plain,
! [X47,X48] :
( p(xor(X47,X48))
| ~ p(X48)
| ~ p(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[combine_with_XOR])])]) ).
fof(c_0_31,negated_conjecture,
~ p(crypt(pp,a)),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ p(crypt(xor(km,exp),X3))
| ~ p(X1)
| ~ p(crypt(xor(km,X1),X2))
| p(crypt(xor(X3,X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
p(crypt(xor(km,pin),pp)),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_6]) ).
cnf(c_0_34,plain,
p(pin),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_5]) ).
cnf(c_0_35,plain,
( ~ p(X2)
| ~ p(xor(kp,X1))
| p(crypt(xor(km,X1),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( ~ p(X2)
| ~ p(X1)
| p(xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
p(kp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_1]) ).
fof(c_0_38,negated_conjecture,
~ p(crypt(pp,a)),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
fof(c_0_39,plain,
! [X51,X52] :
( p(crypt(X51,X52))
| ~ p(X51)
| ~ p(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_knowledge])])]) ).
fof(c_0_40,plain,
! [X49,X50] :
( p(X50)
| ~ p(X49)
| ~ p(crypt(X49,X50)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[decrypt_knowledge])])]) ).
cnf(c_0_41,plain,
( ~ p(crypt(xor(km,exp),X1))
| p(crypt(xor(X1,pin),pp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_42,plain,
( ~ p(X1)
| ~ p(X2)
| p(crypt(xor(km,X1),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
p(exp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_11]) ).
cnf(c_0_44,negated_conjecture,
~ p(crypt(pp,a)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( ~ p(X2)
| ~ p(X1)
| p(crypt(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
p(a),
inference(split_conjunct,[status(thm)],[an_account_number]) ).
cnf(c_0_47,plain,
( ~ p(X1)
| ~ p(crypt(X1,X2))
| p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( ~ p(X1)
| p(crypt(xor(X1,pin),pp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_49,negated_conjecture,
~ p(pp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_50,plain,
( ~ p(X1)
| ~ p(xor(X1,pin)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_51,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_52,plain,
p(id),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_4]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV235+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 % Computer : n003.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Mon Sep 21 08:37:16 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.52 % Version: 3.5.1
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 % Starting sh5l with 300s (1) cores
% 0.19/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3875592 completed with status 0
% 0.19/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FHUSM-FFMM22-MFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 % new_bool_1 with pid 3875603 completed with status 0
% 0.19/0.52 % Result found by new_bool_1
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FHUSM-FFMM22-MFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 % Preprocessing time : 0.002 s
% 0.19/0.52 % Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 % Proof found!
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 29
% 0.19/0.52 % Removed by relevancy pruning/SinE : 0
% 0.19/0.52 % Initial clauses : 29
% 0.19/0.52 % Removed in clause preprocessing : 0
% 0.19/0.52 % Initial clauses in saturation : 29
% 0.19/0.52 % Processed clauses : 437
% 0.19/0.52 % ...of these trivial : 10
% 0.19/0.52 % ...subsumed : 278
% 0.19/0.52 % ...remaining for further processing : 149
% 0.19/0.52 % Other redundant clauses eliminated : 0
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 7
% 0.19/0.52 % Backward-rewritten : 0
% 0.19/0.52 % Generated clauses : 1061
% 0.19/0.52 % ...of the previous two non-redundant : 950
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 0
% 0.19/0.52 % Paramodulations : 1061
% 0.19/0.52 % Factorizations : 0
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 0
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 556
% 0.19/0.52 % ...of those cached : 464
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 113
% 0.19/0.52 % Positive orientable unit clauses : 23
% 0.19/0.52 % Positive unorientable unit clauses: 3
% 0.19/0.52 % Negative unit clauses : 4
% 0.19/0.52 % Non-unit-clauses : 83
% 0.19/0.52 % Current number of unprocessed clauses: 534
% 0.19/0.52 % ...number of literals in the above : 1783
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 36
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 2687
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 1858
% 0.19/0.52 % Non-unit clause-clause subsumptions : 244
% 0.19/0.52 % Unit Clause-clause subsumption calls : 20
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 52
% 0.19/0.52 % BW rewrite match successes : 36
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 16806
% 0.19/0.52 % Search garbage collected termcells : 263
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.027 s
% 0.19/0.52 % System time : 0.006 s
% 0.19/0.52 % Total time : 0.033 s
% 0.19/0.52 % Maximum resident set size: 3664 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.136 s
% 0.19/0.52 % System time : 0.021 s
% 0.19/0.52 % Total time : 0.157 s
% 0.19/0.52 % Maximum resident set size: 4864 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------