TSTP Solution File: SWW949+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW949+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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 : 600s
% DateTime : Thu Jul 21 01:29:23 EDT 2022
% Result : Theorem 14.98s 15.15s
% Output : Refutation 14.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 38 ( 27 unt; 0 nHn; 38 RR)
% Number of literals : 52 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ pred_attacker(name_objective),
file('SWW949+1.p',unknown),
[] ).
cnf(13,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('SWW949+1.p',unknown),
[] ).
cnf(14,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('SWW949+1.p',unknown),
[] ).
cnf(93,axiom,
equal(constr_xor(u,u),constr_ZERO),
file('SWW949+1.p',unknown),
[] ).
cnf(94,axiom,
equal(constr_xor(u,constr_ZERO),u),
file('SWW949+1.p',unknown),
[] ).
cnf(98,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(u))
| pred_attacker(u) ),
file('SWW949+1.p',unknown),
[] ).
cnf(104,axiom,
( ~ pred_attacker(tuple_R_out_4(u))
| pred_attacker(u) ),
file('SWW949+1.p',unknown),
[] ).
cnf(108,axiom,
( ~ pred_attacker(tuple_R_out_1(u))
| pred_attacker(u) ),
file('SWW949+1.p',unknown),
[] ).
cnf(110,axiom,
equal(constr_xor(u,v),constr_xor(v,u)),
file('SWW949+1.p',unknown),
[] ).
cnf(111,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(u,v))
| pred_attacker(u) ),
file('SWW949+1.p',unknown),
[] ).
cnf(112,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(u,v))
| pred_attacker(v) ),
file('SWW949+1.p',unknown),
[] ).
cnf(117,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(constr_xor(v,u)) ),
file('SWW949+1.p',unknown),
[] ).
cnf(120,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(tuple_R_in_2(v,u)) ),
file('SWW949+1.p',unknown),
[] ).
cnf(121,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
file('SWW949+1.p',unknown),
[] ).
cnf(122,axiom,
equal(constr_xor(constr_xor(u,v),w),constr_xor(u,constr_xor(v,w))),
file('SWW949+1.p',unknown),
[] ).
cnf(123,axiom,
( ~ pred_attacker(tuple_R_in_2(u,constr(constr_xor(name_r1,constr_xor(u,name_t)),name_t)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
file('SWW949+1.p',unknown),
[] ).
cnf(125,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_r2_from_1st,name_t),constr(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
inference(rew,[status(thm),theory(equality)],[110,121]),
[iquote('0:Rew:110.0,121.0')] ).
cnf(130,plain,
~ pred_attacker(tuple_R_out_4(name_objective)),
inference(res,[status(thm),theory(equality)],[104,10]),
[iquote('0:Res:104.1,10.0')] ).
cnf(136,plain,
~ pred_attacker(tuple_R_in_2(u,constr(constr_xor(name_r1,constr_xor(u,name_t)),name_t))),
inference(mrr,[status(thm)],[123,130]),
[iquote('0:MRR:123.1,130.0')] ).
cnf(145,plain,
pred_attacker(name_r1),
inference(res,[status(thm),theory(equality)],[14,108]),
[iquote('0:Res:14.0,108.0')] ).
cnf(149,plain,
pred_attacker(name_r1_from_1st),
inference(res,[status(thm),theory(equality)],[13,98]),
[iquote('0:Res:13.0,98.0')] ).
cnf(153,plain,
equal(constr_xor(constr_ZERO,u),u),
inference(spr,[status(thm),theory(equality)],[110,94]),
[iquote('0:SpR:110.0,94.0')] ).
cnf(170,plain,
pred_attacker(constr_xor(name_r2_from_1st,name_t)),
inference(res,[status(thm),theory(equality)],[125,111]),
[iquote('0:Res:125.0,111.0')] ).
cnf(171,plain,
pred_attacker(constr(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t)),
inference(res,[status(thm),theory(equality)],[125,112]),
[iquote('0:Res:125.0,112.0')] ).
cnf(191,plain,
~ pred_attacker(tuple_R_in_2(u,constr(constr_xor(name_r1,constr_xor(name_t,u)),name_t))),
inference(spl,[status(thm),theory(equality)],[110,136]),
[iquote('0:SpL:110.0,136.0')] ).
cnf(198,plain,
equal(constr_xor(u,constr_xor(v,w)),constr_xor(w,constr_xor(u,v))),
inference(spr,[status(thm),theory(equality)],[122,110]),
[iquote('0:SpR:122.0,110.0')] ).
cnf(201,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(constr_xor(v,w))
| pred_attacker(constr_xor(v,constr_xor(w,u))) ),
inference(spr,[status(thm),theory(equality)],[122,117]),
[iquote('0:SpR:122.0,117.2')] ).
cnf(204,plain,
equal(constr_xor(u,constr_xor(u,v)),constr_xor(constr_ZERO,v)),
inference(spr,[status(thm),theory(equality)],[93,122]),
[iquote('0:SpR:93.0,122.0')] ).
cnf(211,plain,
equal(constr_xor(u,constr_xor(u,v)),v),
inference(rew,[status(thm),theory(equality)],[153,204]),
[iquote('0:Rew:153.0,204.0')] ).
cnf(224,plain,
equal(constr_xor(u,constr_xor(v,u)),v),
inference(spr,[status(thm),theory(equality)],[110,211]),
[iquote('0:SpR:110.0,211.0')] ).
cnf(240,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(name_t,u),constr(constr_xor(name_r1,u),name_t))),
inference(spl,[status(thm),theory(equality)],[211,191]),
[iquote('0:SpL:211.0,191.0')] ).
cnf(453,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(name_t,constr_xor(u,name_r1)),constr(u,name_t))),
inference(spl,[status(thm),theory(equality)],[224,240]),
[iquote('0:SpL:224.0,240.0')] ).
cnf(472,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(name_r1,constr_xor(name_t,u)),constr(u,name_t))),
inference(rew,[status(thm),theory(equality)],[198,453]),
[iquote('0:Rew:198.0,453.0')] ).
cnf(546,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(name_r1,constr_xor(u,constr_xor(name_t,v))),constr(constr_xor(v,u),name_t))),
inference(spl,[status(thm),theory(equality)],[198,472]),
[iquote('0:SpL:198.0,472.0')] ).
cnf(557,plain,
( ~ pred_attacker(u)
| pred_attacker(constr_xor(name_r2_from_1st,constr_xor(name_t,u))) ),
inference(sor,[status(thm)],[201,170]),
[iquote('0:SoR:201.1,170.0')] ).
cnf(10375,plain,
( ~ pred_attacker(constr(constr_xor(u,v),name_t))
| ~ pred_attacker(constr_xor(name_r1,constr_xor(v,constr_xor(name_t,u)))) ),
inference(res,[status(thm),theory(equality)],[120,546]),
[iquote('0:Res:120.2,546.0')] ).
cnf(29416,plain,
~ pred_attacker(constr_xor(name_r1,constr_xor(name_r2_from_1st,constr_xor(name_t,name_r1_from_1st)))),
inference(sor,[status(thm)],[10375,171]),
[iquote('0:SoR:10375.0,171.0')] ).
cnf(29417,plain,
$false,
inference(ssi,[status(thm)],[29416,117,145,557,149]),
[iquote('0:SSi:29416.0,117.0,145.1,557.0,149.2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW949+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n023.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 : 600
% 0.13/0.34 % DateTime : Sun Jun 5 09:57:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 14.98/15.15
% 14.98/15.15 SPASS V 3.9
% 14.98/15.15 SPASS beiseite: Proof found.
% 14.98/15.15 % SZS status Theorem
% 14.98/15.15 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.98/15.15 SPASS derived 17877 clauses, backtracked 0 clauses, performed 0 splits and kept 2479 clauses.
% 14.98/15.15 SPASS allocated 118591 KBytes.
% 14.98/15.15 SPASS spent 0:0:14.53 on the problem.
% 14.98/15.15 0:00:00.04 for the input.
% 14.98/15.15 0:00:00.03 for the FLOTTER CNF translation.
% 14.98/15.15 0:00:00.16 for inferences.
% 14.98/15.15 0:00:00.00 for the backtracking.
% 14.98/15.15 0:0:14.25 for the reduction.
% 14.98/15.15
% 14.98/15.15
% 14.98/15.15 Here is a proof with depth 6, length 38 :
% 14.98/15.15 % SZS output start Refutation
% See solution above
% 14.98/15.15 Formulae used in the proof : co0 ax117 ax120 ax78 ax79 ax90 ax99 ax103 ax80 ax87 ax88 ax82 ax104 ax118 ax81 ax122
% 14.98/15.15
%------------------------------------------------------------------------------