%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW957+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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 : Fri Sep 25 03:30:35 PM UTC 2026
% Result : Theorem 3.80s 6.21s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 87 ( 41 unt; 0 def)
% Number of atoms : 144 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 109 ( 52 ~; 47 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 103 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0,X1] : constr_split(constr_concat(X0,X1)) = tuple_2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(f48,axiom,
! [X0,X1] : constr_C(constr_xor(X0,X1)) = constr_xor(constr_C(X0),constr_C(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
fof(f49,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(f50,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f51,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(f52,axiom,
! [X0,X1,X2] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f53,axiom,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax52) ).
fof(f55,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(constr_split(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax54) ).
fof(f59,axiom,
! [X0,X1] :
( pred_attacker(tuple_enc_oracle_out_2(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f60,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_enc_oracle_in_1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax59) ).
fof(f62,axiom,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_concat(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax61) ).
fof(f63,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax62) ).
fof(f73,axiom,
! [X0,X1] :
( pred_attacker(tuple_B_out_1(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax72) ).
fof(f75,axiom,
! [X0,X1] :
( pred_attacker(tuple_2(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
fof(f82,axiom,
! [X0] :
( pred_attacker(tuple_enc_oracle_in_1(X0))
=> pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X0,constr_C(X0)),constr_RC4(name_v,name_Kab)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f84,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f85,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f84]) ).
fof(f86,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f85]) ).
fof(f88,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(ennf_transformation,[],[f53]) ).
fof(f89,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(constr_split(X0)) ),
inference(ennf_transformation,[],[f55]) ).
fof(f94,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_enc_oracle_out_2(X0,X1))
| pred_attacker(X1) ),
inference(ennf_transformation,[],[f59]) ).
fof(f95,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_enc_oracle_in_1(X0)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f97,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_concat(X0,X1)) ),
inference(ennf_transformation,[],[f62]) ).
fof(f98,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_concat(X0,X1)) ),
inference(flattening,[],[f97]) ).
fof(f105,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_B_out_1(X0,X1))
| pred_attacker(X1) ),
inference(ennf_transformation,[],[f73]) ).
fof(f108,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_2(X0,X1))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f114,plain,
! [X0] :
( ~ pred_attacker(tuple_enc_oracle_in_1(X0))
| pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X0,constr_C(X0)),constr_RC4(name_v,name_Kab)))) ),
inference(ennf_transformation,[],[f82]) ).
fof(f160,plain,
! [X0,X1] : constr_split(constr_concat(X0,X1)) = tuple_2(X0,X1),
inference(cnf_transformation,[],[f46]) ).
fof(f162,plain,
! [X0,X1] : constr_C(constr_xor(X0,X1)) = constr_xor(constr_C(X0),constr_C(X1)),
inference(cnf_transformation,[],[f48]) ).
fof(f163,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f49]) ).
fof(f164,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f50]) ).
fof(f165,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f51]) ).
fof(f166,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f52]) ).
fof(f167,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(cnf_transformation,[],[f89]) ).
fof(f169,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(constr_split(X0)) ),
inference(cnf_transformation,[],[f90]) ).
fof(f173,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_enc_oracle_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f174,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_enc_oracle_in_1(X0)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f176,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_concat(X0,X1)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f177,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f63]) ).
fof(f187,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_B_out_1(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f189,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f195,plain,
! [X0] :
( ~ pred_attacker(tuple_enc_oracle_in_1(X0))
| pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X0,constr_C(X0)),constr_RC4(name_v,name_Kab)))) ),
inference(cnf_transformation,[],[f114]) ).
fof(f196,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
inference(cnf_transformation,[],[f83]) ).
fof(f197,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f86]) ).
fof(f199,plain,
! [X0,X1] :
( ~ pred_attacker(constr_split(constr_concat(X0,X1)))
| pred_attacker(X0) ),
inference(definition_unfolding,[],[f189,f160]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : constr_xor(constr_C(X0),constr_C(X1)) = constr_C(constr_xor(X0,X1)),
inference(cnf_transformation,[],[f162]) ).
tcf(c_96,plain,
! [X0: $i] : constr_xor(X0,X0) = constr_ZERO,
inference(cnf_transformation,[],[f163]) ).
tcf(c_97,plain,
! [X0: $i] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f164]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f165]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i,X2: $i] : constr_xor(constr_xor(X0,X1),X2) = constr_xor(X0,constr_xor(X1,X2)),
inference(cnf_transformation,[],[f166]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_102,plain,
! [X0: $i] :
( pred_attacker(constr_split(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_enc_oracle_out_2(X0,X1)) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_107,plain,
! [X0: $i] :
( pred_attacker(tuple_enc_oracle_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i] :
( pred_attacker(constr_concat(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_110,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f177]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_B_out_1(X0,X1)) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X0)
| ~ pred_attacker(constr_split(constr_concat(X0,X1))) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_128,plain,
! [X0: $i] :
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X0,constr_C(X0)),constr_RC4(name_v,name_Kab))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X0)) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_129,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
inference(cnf_transformation,[],[f196]) ).
tcf(c_130,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f197]) ).
tcf(c_153,plain,
! [X0: $i] :
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X0,constr_C(X0)))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X0)) ),
inference(theory_normalisation,[status(thm)],[c_128,c_99,c_98]) ).
tcf(c_154,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective))))),
inference(theory_normalisation,[status(thm)],[c_129,c_99,c_98]) ).
tcf(c_164,plain,
! [X0: $i] :
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X0,constr_C(X0)))))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_107,c_153]) ).
tcf(c_611,plain,
! [X0: $i] :
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X0,constr_C(X0)))))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_164]) ).
tcf(c_1021,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_1906,plain,
! [X0: $i] :
( pred_attacker(constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X0,constr_C(X0))))
| ~ pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_611,c_106]) ).
tcf(c_1919,plain,
pred_attacker(constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective)))),
inference(superposition,[status(thm)],[c_154,c_120]) ).
tcf(c_1927,plain,
! [X0: $i] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[status(thm)],[c_98,c_97]) ).
tcf(c_1941,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X0)
| ~ pred_attacker(constr_concat(X0,X1)) ),
inference(superposition,[status(thm)],[c_102,c_122]) ).
tcf(c_2033,plain,
! [X0: $i] : constr_C(constr_xor(X0,X0)) = constr_ZERO,
inference(superposition,[status(thm)],[c_95,c_96]) ).
tcf(c_2035,plain,
constr_C(constr_ZERO) = constr_ZERO,
inference(light_normalisation,[status(thm)],[c_2033,c_96]) ).
tcf(c_2043,plain,
( pred_attacker(constr_xor(constr_RC4(name_v,name_Kab),constr_concat(constr_ZERO,constr_ZERO)))
| ~ pred_attacker(constr_ZERO) ),
inference(superposition,[status(thm)],[c_2035,c_1906]) ).
tcf(c_2050,plain,
( pred_attacker(constr_xor(constr_concat(constr_ZERO,constr_ZERO),constr_RC4(name_v,name_Kab)))
| ~ pred_attacker(constr_ZERO) ),
inference(theory_normalisation,[status(thm)],[c_2043,c_99,c_98]) ).
tcf(c_2051,plain,
pred_attacker(constr_xor(constr_concat(constr_ZERO,constr_ZERO),constr_RC4(name_v,name_Kab))),
inference(forward_subsumption_resolution,[status(thm)],[c_2050,c_110]) ).
tcf(c_2072,plain,
! [X0: $i,X1: $i] : constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[status(thm)],[c_96,c_99]) ).
tcf(c_2091,plain,
! [X0: $i,X1: $i] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_2072,c_1927]) ).
tcf(c_2101,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X1)
| ~ pred_attacker(X0)
| ~ pred_attacker(constr_xor(X0,X1)) ),
inference(superposition,[status(thm)],[c_2091,c_100]) ).
tcf(c_2143,plain,
( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
| ~ pred_attacker(constr_RC4(name_v,name_Kab)) ),
inference(superposition,[status(thm)],[c_1919,c_2101]) ).
tcf(c_2144,plain,
( pred_attacker(constr_RC4(name_v,name_Kab))
| ~ pred_attacker(constr_concat(constr_ZERO,constr_ZERO)) ),
inference(superposition,[status(thm)],[c_2051,c_2101]) ).
tcf(c_2174,plain,
( pred_attacker(constr_RC4(name_v,name_Kab))
| ~ pred_attacker(constr_ZERO) ),
inference(superposition,[status(thm)],[c_109,c_2144]) ).
tcf(c_2175,plain,
pred_attacker(constr_RC4(name_v,name_Kab)),
inference(forward_subsumption_resolution,[status(thm)],[c_2174,c_110]) ).
tcf(c_2176,plain,
pred_attacker(constr_concat(name_objective,constr_C(name_objective))),
inference(global_subsumption_just,[status(thm)],[c_2143,c_2143,c_2175]) ).
tcf(c_2179,plain,
pred_attacker(name_objective),
inference(superposition,[status(thm)],[c_2176,c_1941]) ).
tcf(c_2180,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2179,c_1021]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW957+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.39 % Computer : n007.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Thu Sep 24 23:13:28 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.46 % Proving...
% 3.80/6.21 % SZS status Started for theBenchmark.p
% 3.80/6.21 % SZS status Theorem for theBenchmark.p
% 3.80/6.21
% 3.80/6.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.80/6.21
% 3.80/6.21 % ------ iProver source info
% 3.80/6.21
% 3.80/6.21 % git: date: 2026-07-19 20:42:38 +0200
% 3.80/6.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.80/6.21 % git: non_committed_changes: false
% 3.80/6.21
% 3.80/6.21 % ------ Parsing...
% 3.80/6.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.80/6.21
% 3.80/6.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.80/6.21
% 3.80/6.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.80/6.21
% 3.80/6.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.80/6.21 % ------ Proving...
% 3.80/6.21 % ------ Problem Properties
% 3.80/6.21
% 3.80/6.21 %
% 3.80/6.21 % clauses 80
% 3.80/6.21 % conjectures 1
% 3.80/6.21 % EPR 55
% 3.80/6.21 % Horn 80
% 3.80/6.21 % unary 63
% 3.80/6.21 % binary 11
% 3.80/6.21 % lits 103
% 3.80/6.21 % lits eq 51
% 3.80/6.21 % fd_pure 0
% 3.80/6.21 % fd_pseudo 0
% 3.80/6.21 % fd_cond 0
% 3.80/6.21 % fd_pseudo_cond 0
% 3.80/6.21 % AC symbols 1
% 3.80/6.21
% 3.80/6.21 % ------ Schedule dynamic 5 is on
% 3.80/6.21
% 3.80/6.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.80/6.21
% 3.80/6.21
% 3.80/6.21 % ------
% 3.80/6.21 % Current options:
% 3.80/6.21 % ------
% 3.80/6.21
% 3.80/6.21
% 3.80/6.21 %
% 3.80/6.21
% 3.80/6.21 % ------ Proving...
% 3.80/6.21 %
% 3.80/6.21
% 3.80/6.21 % SZS status Theorem for theBenchmark.p
% 3.80/6.21
% 3.80/6.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.80/6.22
%------------------------------------------------------------------------------