TSTP Solution File: SWW955+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW955+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 12 unt; 0 nHn; 26 RR)
% Number of literals : 42 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
~ pred_attacker(name_objective),
file('SWW955+1.p',unknown),
[] ).
cnf(57,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('SWW955+1.p',unknown),
[] ).
cnf(65,axiom,
( ~ pred_attacker(tuple_A_out_4(u))
| pred_attacker(u) ),
file('SWW955+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ pred_attacker(tuple_A_out_3(u))
| pred_attacker(u) ),
file('SWW955+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ pred_attacker(tuple_A_out_1(u))
| pred_attacker(u) ),
file('SWW955+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_A_in_2(u)) ),
file('SWW955+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ pred_attacker(tuple_A_in_2(u))
| pred_attacker(u) ),
file('SWW955+1.p',unknown),
[] ).
cnf(72,axiom,
equal(constr_dec(constr_enc(u,v),v),u),
file('SWW955+1.p',unknown),
[] ).
cnf(73,axiom,
equal(constr_comm_dec(constr_comm_enc(u,v),v),u),
file('SWW955+1.p',unknown),
[] ).
cnf(76,axiom,
( ~ pred_attacker(tuple_A_in_2(u))
| pred_attacker(tuple_A_out_3(constr_comm_dec(u,name_Ka))) ),
file('SWW955+1.p',unknown),
[] ).
cnf(77,axiom,
( ~ pred_attacker(tuple_A_in_2(u))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('SWW955+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(constr_dec(v,u)) ),
file('SWW955+1.p',unknown),
[] ).
cnf(89,plain,
~ pred_attacker(tuple_A_in_2(name_objective)),
inference(res,[status(thm),theory(equality)],[71,9]),
[iquote('0:Res:71.1,9.0')] ).
cnf(91,plain,
~ pred_attacker(name_objective),
inference(res,[status(thm),theory(equality)],[70,89]),
[iquote('0:Res:70.1,89.0')] ).
cnf(99,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(res,[status(thm),theory(equality)],[57,69]),
[iquote('0:Res:57.0,69.0')] ).
cnf(108,plain,
( ~ pred_attacker(u)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(res,[status(thm),theory(equality)],[70,77]),
[iquote('0:Res:70.1,77.0')] ).
cnf(110,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(ems,[status(thm)],[108,99]),
[iquote('0:EmS:108.0,99.0')] ).
cnf(130,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(res,[status(thm),theory(equality)],[110,65]),
[iquote('0:Res:110.0,65.0')] ).
cnf(132,plain,
( ~ pred_attacker(tuple_A_in_2(u))
| pred_attacker(constr_comm_dec(u,name_Ka)) ),
inference(res,[status(thm),theory(equality)],[76,67]),
[iquote('0:Res:76.1,67.0')] ).
cnf(133,plain,
( ~ pred_attacker(tuple_A_in_2(constr_comm_enc(u,name_Ka)))
| pred_attacker(u) ),
inference(spr,[status(thm),theory(equality)],[73,132]),
[iquote('0:SpR:73.0,132.1')] ).
cnf(134,plain,
( ~ pred_attacker(constr_comm_enc(u,name_Ka))
| pred_attacker(u) ),
inference(res,[status(thm),theory(equality)],[70,133]),
[iquote('0:Res:70.1,133.0')] ).
cnf(135,plain,
pred_attacker(name_m_9),
inference(sor,[status(thm)],[134,99]),
[iquote('0:SoR:134.0,99.0')] ).
cnf(146,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(constr_enc(v,u))
| pred_attacker(v) ),
inference(spr,[status(thm),theory(equality)],[72,80]),
[iquote('0:SpR:72.0,80.2')] ).
cnf(151,plain,
( ~ pred_attacker(name_m_9)
| pred_attacker(name_objective) ),
inference(sor,[status(thm)],[146,130]),
[iquote('0:SoR:146.1,130.0')] ).
cnf(152,plain,
pred_attacker(name_objective),
inference(ssi,[status(thm)],[151,135]),
[iquote('0:SSi:151.0,135.0')] ).
cnf(153,plain,
$false,
inference(mrr,[status(thm)],[152,91]),
[iquote('0:MRR:152.0,91.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWW955+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 5 16:59:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 67 clauses, backtracked 0 clauses, performed 0 splits and kept 106 clauses.
% 0.21/0.46 SPASS allocated 97757 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.46 0:00:00.03 for the input.
% 0.21/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.00 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 4, length 26 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : co0 ax77 ax65 ax67 ax69 ax70 ax71 ax45 ax46 ax78 ax79 ax50
% 0.21/0.46
%------------------------------------------------------------------------------