TSTP Solution File: SWV236+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 : Thu Aug 31 22:31:43 EDT 2023
% Result : Theorem 2.88s 1.16s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 23 unt; 0 def)
% Number of atoms : 81 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 72 ( 36 ~; 27 |; 6 &)
% ( 0 <=>; 3 =>; 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 : 62 ( 4 sgn; 34 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutative) ).
fof(f2,axiom,
! [X0,X1,X2] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_associative) ).
fof(f4,axiom,
! [X0] : xor(X0,id) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_rules_1) ).
fof(f5,axiom,
! [X0] : id = xor(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_rules_2) ).
fof(f8,axiom,
! [X9,X8] :
( ( p(X8)
& p(X9) )
=> p(crypt(xor(km,xor(kp,X8)),X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',key_part_import___part_1) ).
fof(f14,axiom,
! [X0,X1] :
( ( p(X1)
& p(X0) )
=> p(xor(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',combine_with_XOR) ).
fof(f18,axiom,
p(kp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_1) ).
fof(f26,axiom,
p(exp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_9) ).
fof(f28,conjecture,
? [X11] :
( p(X11)
& p(crypt(xor(km,exp),X11)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',find_known_exporter) ).
fof(f29,negated_conjecture,
~ ? [X11] :
( p(X11)
& p(crypt(xor(km,exp),X11)) ),
inference(negated_conjecture,[],[f28]) ).
fof(f32,plain,
! [X0,X1] :
( ( p(X1)
& p(X0) )
=> p(crypt(xor(km,xor(kp,X1)),X0)) ),
inference(rectify,[],[f8]) ).
fof(f38,plain,
~ ? [X0] :
( p(X0)
& p(crypt(xor(km,exp),X0)) ),
inference(rectify,[],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f44,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f43]) ).
fof(f55,plain,
! [X0,X1] :
( p(xor(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f56,plain,
! [X0,X1] :
( p(xor(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f55]) ).
fof(f62,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(ennf_transformation,[],[f38]) ).
fof(f63,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f64,plain,
! [X2,X0,X1] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f66,plain,
! [X0] : xor(X0,id) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0] : id = xor(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f70,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f76,plain,
! [X0,X1] :
( p(xor(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f80,plain,
p(kp),
inference(cnf_transformation,[],[f18]) ).
fof(f88,plain,
p(exp),
inference(cnf_transformation,[],[f26]) ).
fof(f90,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_49,plain,
xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f63]) ).
cnf(c_50,plain,
xor(xor(X0,X1),X2) = xor(X0,xor(X1,X2)),
inference(cnf_transformation,[],[f64]) ).
cnf(c_52,plain,
xor(X0,id) = X0,
inference(cnf_transformation,[],[f66]) ).
cnf(c_53,plain,
xor(X0,X0) = id,
inference(cnf_transformation,[],[f67]) ).
cnf(c_56,plain,
( ~ p(X0)
| ~ p(X1)
| p(crypt(xor(km,xor(kp,X1)),X0)) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_62,plain,
( ~ p(X0)
| ~ p(X1)
| p(xor(X0,X1)) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_66,plain,
p(kp),
inference(cnf_transformation,[],[f80]) ).
cnf(c_74,plain,
p(exp),
inference(cnf_transformation,[],[f88]) ).
cnf(c_76,negated_conjecture,
( ~ p(crypt(xor(km,exp),X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_612,plain,
xor(id,X0) = X0,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_628,plain,
( ~ p(X0)
| ~ p(X1)
| p(xor(X1,X0)) ),
inference(superposition,[status(thm)],[c_49,c_62]) ).
cnf(c_682,plain,
xor(X0,xor(X0,X1)) = xor(id,X1),
inference(superposition,[status(thm)],[c_53,c_50]) ).
cnf(c_819,plain,
xor(X0,xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_682,c_612]) ).
cnf(c_830,plain,
( ~ p(xor(kp,X0))
| ~ p(X1)
| p(crypt(xor(km,X0),X1)) ),
inference(superposition,[status(thm)],[c_819,c_56]) ).
cnf(c_1753,plain,
( ~ p(xor(kp,exp))
| ~ p(X0) ),
inference(superposition,[status(thm)],[c_830,c_76]) ).
cnf(c_1755,plain,
( ~ p(xor(exp,kp))
| ~ p(X0) ),
inference(theory_normalisation,[status(thm)],[c_1753,c_50,c_49]) ).
cnf(c_1814,plain,
( ~ p(X0)
| ~ p(exp)
| ~ p(kp) ),
inference(superposition,[status(thm)],[c_628,c_1755]) ).
cnf(c_1815,plain,
~ p(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1814,c_66,c_74]) ).
cnf(c_1816,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_66,c_1815]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 04:52:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.88/1.16 % SZS status Started for theBenchmark.p
% 2.88/1.16 % SZS status Theorem for theBenchmark.p
% 2.88/1.16
% 2.88/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.88/1.16
% 2.88/1.16 ------ iProver source info
% 2.88/1.16
% 2.88/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.88/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.88/1.16 git: non_committed_changes: false
% 2.88/1.16 git: last_make_outside_of_git: false
% 2.88/1.16
% 2.88/1.16 ------ Parsing...
% 2.88/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.88/1.16
% 2.88/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.88/1.16
% 2.88/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.88/1.16
% 2.88/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.88/1.16 ------ Proving...
% 2.88/1.16 ------ Problem Properties
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16 clauses 28
% 2.88/1.16 conjectures 1
% 2.88/1.16 EPR 7
% 2.88/1.16 Horn 28
% 2.88/1.16 unary 15
% 2.88/1.16 binary 2
% 2.88/1.16 lits 58
% 2.88/1.16 lits eq 5
% 2.88/1.16 fd_pure 0
% 2.88/1.16 fd_pseudo 0
% 2.88/1.16 fd_cond 0
% 2.88/1.16 fd_pseudo_cond 0
% 2.88/1.16 AC symbols 1
% 2.88/1.16
% 2.88/1.16 ------ Schedule dynamic 5 is on
% 2.88/1.16
% 2.88/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16 ------
% 2.88/1.16 Current options:
% 2.88/1.16 ------
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16 ------ Proving...
% 2.88/1.16
% 2.88/1.16
% 2.88/1.16 % SZS status Theorem for theBenchmark.p
% 2.88/1.16
% 2.88/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.88/1.16
% 2.88/1.16
%------------------------------------------------------------------------------