TSTP Solution File: SWV234+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV234+2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:13:48 EDT 2024
% Result : Theorem 17.35s 3.22s
% Output : CNFRefutation 17.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 48 unt; 0 def)
% Number of atoms : 115 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 92 ( 46 ~; 41 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 98 ( 6 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( public(X1)
& public(X0) )
=> public(enc(enc(inv(xor(data,km)),X0),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_data_cmd) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( public(enc(xor(km,imp),X0))
& public(enc(xor(X0,X1),X2))
& public(X1) )
=> public(enc(xor(km,X1),X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',key_import_cmd) ).
fof(f8,axiom,
! [X0,X1,X2] : enc(X0,enc(inv(X0),X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_decrypt_cancel) ).
fof(f9,axiom,
! [X0,X1,X2] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutes) ).
fof(f10,axiom,
! [X0,X1,X2] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_assosciative) ).
fof(f11,axiom,
! [X0,X1,X2] : xor(X0,X0) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_self_cancel) ).
fof(f12,axiom,
! [X0,X1,X2] : xor(X0,z) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_zero) ).
fof(f14,axiom,
public(data),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge2) ).
fof(f17,axiom,
public(enc(xor(kek,pin),pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge5) ).
fof(f20,axiom,
public(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge8) ).
fof(f21,axiom,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge9) ).
fof(f22,conjecture,
public(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f23,negated_conjecture,
~ public(enc(pp,a)),
inference(negated_conjecture,[],[f22]) ).
fof(f24,plain,
! [X0,X1] : enc(X0,enc(inv(X0),X1)) = X1,
inference(rectify,[],[f8]) ).
fof(f25,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(rectify,[],[f9]) ).
fof(f26,plain,
! [X0] : xor(X0,X0) = z,
inference(rectify,[],[f11]) ).
fof(f27,plain,
! [X0] : xor(X0,z) = X0,
inference(rectify,[],[f12]) ).
fof(f28,plain,
~ public(enc(pp,a)),
inference(flattening,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( public(enc(enc(inv(xor(data,km)),X0),X1))
| ~ public(X1)
| ~ public(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f37,plain,
! [X0,X1] :
( public(enc(enc(inv(xor(data,km)),X0),X1))
| ~ public(X1)
| ~ public(X0) ),
inference(flattening,[],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( public(enc(xor(km,X1),X2))
| ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f39,plain,
! [X0,X1,X2] :
( public(enc(xor(km,X1),X2))
| ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1) ),
inference(flattening,[],[f38]) ).
fof(f46,plain,
! [X0,X1] :
( public(enc(enc(inv(xor(data,km)),X0),X1))
| ~ public(X1)
| ~ public(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f47,plain,
! [X2,X0,X1] :
( public(enc(xor(km,X1),X2))
| ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f49,plain,
! [X0,X1] : enc(X0,enc(inv(X0),X1)) = X1,
inference(cnf_transformation,[],[f24]) ).
fof(f50,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f25]) ).
fof(f51,plain,
! [X2,X0,X1] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
inference(cnf_transformation,[],[f10]) ).
fof(f52,plain,
! [X0] : xor(X0,X0) = z,
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
! [X0] : xor(X0,z) = X0,
inference(cnf_transformation,[],[f27]) ).
fof(f55,plain,
public(data),
inference(cnf_transformation,[],[f14]) ).
fof(f58,plain,
public(enc(xor(kek,pin),pp)),
inference(cnf_transformation,[],[f17]) ).
fof(f61,plain,
public(a),
inference(cnf_transformation,[],[f20]) ).
fof(f62,plain,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
inference(cnf_transformation,[],[f21]) ).
fof(f63,plain,
~ public(enc(pp,a)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_53,plain,
( ~ public(X0)
| ~ public(X1)
| public(enc(enc(inv(xor(data,km)),X0),X1)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_54,plain,
( ~ public(enc(xor(X0,X1),X2))
| ~ public(enc(xor(km,imp),X0))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_56,plain,
enc(X0,enc(inv(X0),X1)) = X1,
inference(cnf_transformation,[],[f49]) ).
cnf(c_57,plain,
xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f50]) ).
cnf(c_58,plain,
xor(xor(X0,X1),X2) = xor(X0,xor(X1,X2)),
inference(cnf_transformation,[],[f51]) ).
cnf(c_59,plain,
xor(X0,X0) = z,
inference(cnf_transformation,[],[f52]) ).
cnf(c_60,plain,
xor(X0,z) = X0,
inference(cnf_transformation,[],[f53]) ).
cnf(c_62,plain,
public(data),
inference(cnf_transformation,[],[f55]) ).
cnf(c_65,plain,
public(enc(xor(kek,pin),pp)),
inference(cnf_transformation,[],[f58]) ).
cnf(c_68,plain,
public(a),
inference(cnf_transformation,[],[f61]) ).
cnf(c_69,plain,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
inference(cnf_transformation,[],[f62]) ).
cnf(c_70,negated_conjecture,
~ public(enc(pp,a)),
inference(cnf_transformation,[],[f63]) ).
cnf(c_82,plain,
( ~ public(X0)
| ~ public(X1)
| public(enc(enc(inv(xor(km,data)),X0),X1)) ),
inference(theory_normalisation,[status(thm)],[c_53,c_58,c_57]) ).
cnf(c_83,plain,
( ~ public(enc(xor(X0,X1),X2))
| ~ public(enc(xor(imp,km),X0))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(theory_normalisation,[status(thm)],[c_54,c_58,c_57]) ).
cnf(c_84,plain,
public(enc(xor(imp,km),xor(kek,xor(pin,data)))),
inference(theory_normalisation,[status(thm)],[c_69,c_58,c_57]) ).
cnf(c_2031,plain,
( ~ public(X0)
| ~ public(X1)
| public(enc(enc(inv(xor(data,km)),X0),X1)) ),
inference(theory_normalisation,[status(thm)],[c_82,c_58,c_57]) ).
cnf(c_2036,plain,
( ~ public(enc(xor(X0,X1),X2))
| ~ public(enc(xor(km,imp),X0))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(theory_normalisation,[status(thm)],[c_83,c_58,c_57]) ).
cnf(c_2041,plain,
public(enc(xor(km,imp),xor(data,xor(kek,pin)))),
inference(theory_normalisation,[status(thm)],[c_84,c_58,c_57]) ).
cnf(c_2042,plain,
( ~ public(enc(xor(xor(data,xor(kek,pin)),X0),X1))
| ~ public(X0)
| public(enc(xor(km,X0),X1)) ),
inference(superposition,[status(thm)],[c_2041,c_2036]) ).
cnf(c_2043,plain,
( ~ public(enc(xor(data,xor(kek,xor(pin,X0))),X1))
| ~ public(X0)
| public(enc(xor(km,X0),X1)) ),
inference(theory_normalisation,[status(thm)],[c_2042,c_58,c_57]) ).
cnf(c_2232,plain,
xor(z,X0) = X0,
inference(superposition,[status(thm)],[c_57,c_60]) ).
cnf(c_2512,plain,
enc(inv(inv(X0)),X1) = enc(X0,X1),
inference(superposition,[status(thm)],[c_56,c_56]) ).
cnf(c_2541,plain,
enc(inv(X0),enc(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_2512,c_56]) ).
cnf(c_2550,plain,
( ~ public(enc(xor(data,km),X0))
| ~ public(X1)
| public(enc(X0,X1)) ),
inference(superposition,[status(thm)],[c_2541,c_2031]) ).
cnf(c_3948,plain,
xor(X0,xor(X0,X1)) = xor(z,X1),
inference(superposition,[status(thm)],[c_59,c_58]) ).
cnf(c_4000,plain,
xor(X0,xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_3948,c_2232]) ).
cnf(c_4052,plain,
xor(X0,xor(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_57,c_4000]) ).
cnf(c_4175,plain,
xor(X0,xor(X1,xor(X2,X0))) = xor(X1,X2),
inference(superposition,[status(thm)],[c_58,c_4052]) ).
cnf(c_5103,plain,
( ~ public(enc(xor(kek,pin),X0))
| ~ public(data)
| public(enc(xor(km,data),X0)) ),
inference(superposition,[status(thm)],[c_4175,c_2043]) ).
cnf(c_5132,plain,
( ~ public(enc(xor(kek,pin),X0))
| public(enc(xor(km,data),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5103,c_62]) ).
cnf(c_5133,plain,
( ~ public(enc(xor(kek,pin),X0))
| public(enc(xor(data,km),X0)) ),
inference(theory_normalisation,[status(thm)],[c_5132,c_58,c_57]) ).
cnf(c_8475,plain,
public(enc(xor(data,km),pp)),
inference(superposition,[status(thm)],[c_65,c_5133]) ).
cnf(c_8490,plain,
( ~ public(X0)
| public(enc(pp,X0)) ),
inference(superposition,[status(thm)],[c_8475,c_2550]) ).
cnf(c_9108,plain,
~ public(a),
inference(superposition,[status(thm)],[c_8490,c_70]) ).
cnf(c_9109,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9108,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV234+2 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.15 % Command : run_iprover %s %d THM
% 0.16/0.38 % Computer : n006.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Fri May 3 00:06:49 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.37/0.54 Running first-order theorem proving
% 0.37/0.54 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 17.35/3.22 % SZS status Started for theBenchmark.p
% 17.35/3.22 % SZS status Theorem for theBenchmark.p
% 17.35/3.22
% 17.35/3.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.35/3.22
% 17.35/3.22 ------ iProver source info
% 17.35/3.22
% 17.35/3.22 git: date: 2024-05-02 19:28:25 +0000
% 17.35/3.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.35/3.22 git: non_committed_changes: false
% 17.35/3.22
% 17.35/3.22 ------ Parsing...
% 17.35/3.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.35/3.22
% 17.35/3.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 17.35/3.22
% 17.35/3.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.35/3.22
% 17.35/3.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.35/3.22 ------ Proving...
% 17.35/3.22 ------ Problem Properties
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22 clauses 22
% 17.35/3.22 conjectures 1
% 17.35/3.22 EPR 6
% 17.35/3.22 Horn 22
% 17.35/3.22 unary 15
% 17.35/3.22 binary 1
% 17.35/3.22 lits 37
% 17.35/3.22 lits eq 5
% 17.35/3.22 fd_pure 0
% 17.35/3.22 fd_pseudo 0
% 17.35/3.22 fd_cond 0
% 17.35/3.22 fd_pseudo_cond 0
% 17.35/3.22 AC symbols 1
% 17.35/3.22
% 17.35/3.22 ------ Input Options Time Limit: Unbounded
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22 ------
% 17.35/3.22 Current options:
% 17.35/3.22 ------
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22 ------ Proving...
% 17.35/3.22
% 17.35/3.22
% 17.35/3.22 % SZS status Theorem for theBenchmark.p
% 17.35/3.22
% 17.35/3.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.35/3.22
% 17.35/3.22
%------------------------------------------------------------------------------