%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV236+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:52 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 20 unt; 0 def)
% Number of atoms : 52 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 14 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 1 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xor_rules_1,axiom,
! [X1] : xor(X1,id) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_rules_1) ).
fof(xor_commutative,axiom,
! [X1,X2] : xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',xor_associative) ).
fof(xor_rules_2,axiom,
! [X1] : xor(X1,X1) = id,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_rules_2) ).
fof(key_part_import___part_1,axiom,
! [X10,X9] :
( ( p(X9)
& p(X10) )
=> p(crypt(xor(km,xor(kp,X9)),X10)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',key_part_import___part_1) ).
fof(find_known_exporter,conjecture,
? [X12] :
( p(X12)
& p(crypt(xor(km,exp),X12)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',find_known_exporter) ).
fof(combine_with_XOR,axiom,
! [X1,X2] :
( ( p(X2)
& p(X1) )
=> p(xor(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',combine_with_XOR) ).
fof(initial_knowledge_of_intruder_1,axiom,
p(kp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_1) ).
fof(initial_knowledge_of_intruder_9,axiom,
p(exp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_9) ).
fof(c_0_9,plain,
! [X20] : xor(X20,id) = X20,
inference(variable_rename,[status(thm)],[xor_rules_1]) ).
fof(c_0_10,plain,
! [X13,X14] : xor(X13,X14) = xor(X14,X13),
inference(variable_rename,[status(thm)],[xor_commutative]) ).
fof(c_0_11,plain,
! [X15,X16,X17] : xor(X15,xor(X16,X17)) = xor(xor(X15,X16),X17),
inference(variable_rename,[status(thm)],[xor_associative]) ).
fof(c_0_12,plain,
! [X21] : xor(X21,X21) = id,
inference(variable_rename,[status(thm)],[xor_rules_2]) ).
cnf(c_0_13,plain,
xor(X1,id) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
xor(X1,X2) = xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X30,X31] :
( p(crypt(xor(km,xor(kp,X31)),X30))
| ~ p(X31)
| ~ p(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_part_import___part_1])])]) ).
cnf(c_0_16,plain,
xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
xor(X1,X1) = id,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,negated_conjecture,
~ ? [X12] :
( p(X12)
& p(crypt(xor(km,exp),X12)) ),
inference(assume_negation,[status(cth)],[find_known_exporter]) ).
cnf(c_0_20,plain,
( ~ p(X2)
| ~ p(X1)
| p(crypt(xor(km,xor(kp,X2)),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
fof(c_0_22,plain,
! [X48,X49] :
( p(xor(X48,X49))
| ~ p(X49)
| ~ p(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[combine_with_XOR])])]) ).
fof(c_0_23,negated_conjecture,
! [X56] :
( ~ p(X56)
| ~ p(crypt(xor(km,exp),X56)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_24,plain,
( ~ p(X2)
| ~ p(xor(kp,X1))
| p(crypt(xor(km,X1),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ p(X2)
| ~ p(X1)
| p(xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
p(kp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_1]) ).
cnf(c_0_27,negated_conjecture,
( ~ p(X1)
| ~ p(crypt(xor(km,exp),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,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_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
p(exp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_9]) ).
cnf(c_0_30,negated_conjecture,
~ p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV236+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n016.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:40:23 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/benchmark/theBenchmark.p
% 0.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2042110 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FHHSM-FFMM22-MFFFFFNN
% 0.15/0.45 % partial match(1): FHUSM-FFMM22-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2042118 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FHHSM-FFMM22-MFFFFFNN
% 0.15/0.45 % partial match(1): FHUSM-FFMM22-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45 % Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 28
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 28
% 0.15/0.46 % Removed in clause preprocessing : 0
% 0.15/0.46 % Initial clauses in saturation : 28
% 0.15/0.46 % Processed clauses : 228
% 0.15/0.46 % ...of these trivial : 4
% 0.15/0.46 % ...subsumed : 120
% 0.15/0.46 % ...remaining for further processing : 104
% 0.15/0.46 % Other redundant clauses eliminated : 0
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 53
% 0.15/0.46 % Backward-rewritten : 0
% 0.15/0.46 % Generated clauses : 553
% 0.15/0.46 % ...of the previous two non-redundant : 457
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 0
% 0.15/0.46 % Paramodulations : 541
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 0
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 280
% 0.15/0.46 % ...of those cached : 217
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 11
% 0.15/0.46 % Positive orientable unit clauses : 7
% 0.15/0.46 % Positive unorientable unit clauses: 3
% 0.15/0.46 % Negative unit clauses : 1
% 0.15/0.46 % Non-unit-clauses : 0
% 0.15/0.46 % Current number of unprocessed clauses: 267
% 0.15/0.46 % ...number of literals in the above : 728
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 93
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 766
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 671
% 0.15/0.46 % Non-unit clause-clause subsumptions : 92
% 0.15/0.46 % Unit Clause-clause subsumption calls : 93
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 40
% 0.15/0.46 % BW rewrite match successes : 33
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 8308
% 0.15/0.46 % Search garbage collected termcells : 289
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.011 s
% 0.15/0.46 % System time : 0.006 s
% 0.15/0.46 % Total time : 0.017 s
% 0.15/0.46 % Maximum resident set size: 3664 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.052 s
% 0.15/0.46 % System time : 0.022 s
% 0.15/0.46 % Total time : 0.073 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------