TSTP Solution File: SWW956+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW956+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 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 36 ( 0 equ; 20 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 : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
~ pred_attacker(name_objective),
file('SWW956+1.p',unknown),
[] ).
cnf(67,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('SWW956+1.p',unknown),
[] ).
cnf(73,axiom,
( ~ pred_attacker(tuple_A_out_4(u))
| pred_attacker(u) ),
file('SWW956+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ pred_attacker(tuple_A_out_2(u))
| pred_attacker(u) ),
file('SWW956+1.p',unknown),
[] ).
cnf(76,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_A_in_3(u)) ),
file('SWW956+1.p',unknown),
[] ).
cnf(77,axiom,
( ~ pred_attacker(tuple_A_in_3(u))
| pred_attacker(u) ),
file('SWW956+1.p',unknown),
[] ).
cnf(78,axiom,
equal(constr_dec(constr_enc(u,v),v),u),
file('SWW956+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ pred_attacker(tuple_A_out_1(u,v))
| pred_attacker(v) ),
file('SWW956+1.p',unknown),
[] ).
cnf(83,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('SWW956+1.p',unknown),
[] ).
cnf(89,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(constr_dec(v,u)) ),
file('SWW956+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ pred_attacker(tuple_A_in_3(u))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(u,name_Na),name_P_7)))) ),
file('SWW956+1.p',unknown),
[] ).
cnf(101,plain,
~ pred_attacker(tuple_A_in_3(name_objective)),
inference(res,[status(thm),theory(equality)],[77,9]),
[iquote('0:Res:77.1,9.0')] ).
cnf(105,plain,
~ pred_attacker(name_objective),
inference(res,[status(thm),theory(equality)],[76,101]),
[iquote('0:Res:76.1,101.0')] ).
cnf(115,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(res,[status(thm),theory(equality)],[83,75]),
[iquote('0:Res:83.0,75.0')] ).
cnf(116,plain,
pred_attacker(name_G_8),
inference(res,[status(thm),theory(equality)],[67,82]),
[iquote('0:Res:67.0,82.0')] ).
cnf(135,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(constr_enc(v,u))
| pred_attacker(v) ),
inference(spr,[status(thm),theory(equality)],[78,89]),
[iquote('0:SpR:78.0,89.2')] ).
cnf(137,plain,
( ~ pred_attacker(tuple_A_in_3(u))
| pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(u,name_Na),name_P_7))) ),
inference(res,[status(thm),theory(equality)],[92,73]),
[iquote('0:Res:92.1,73.0')] ).
cnf(138,plain,
( ~ pred_attacker(constr_mod(constr_exp(u,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(u))
| pred_attacker(name_objective) ),
inference(sor,[status(thm)],[135,137]),
[iquote('0:SoR:135.1,137.1')] ).
cnf(139,plain,
( ~ pred_attacker(constr_mod(constr_exp(u,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(u)) ),
inference(mrr,[status(thm)],[138,105]),
[iquote('0:MRR:138.2,105.0')] ).
cnf(141,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(sor,[status(thm)],[139,115]),
[iquote('0:SoR:139.0,115.0')] ).
cnf(153,plain,
~ pred_attacker(name_G_8),
inference(res,[status(thm),theory(equality)],[76,141]),
[iquote('0:Res:76.1,141.0')] ).
cnf(154,plain,
$false,
inference(ssi,[status(thm)],[153,116]),
[iquote('0:SSi:153.0,116.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 4 11:51:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 51 clauses, backtracked 0 clauses, performed 0 splits and kept 117 clauses.
% 0.19/0.45 SPASS allocated 97779 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 4, length 22 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : co0 ax89 ax76 ax78 ax82 ax83 ax55 ax81 ax90 ax62 ax91
% 0.19/0.45
%------------------------------------------------------------------------------