TSTP Solution File: SWW951+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 : 6
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ pred_attacker(name_objective),
file('SWW951+1.p',unknown),
[] ).
cnf(12,axiom,
pred_attacker(name_new0x2Dname(u)),
file('SWW951+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ pred_attacker(tuple_T_out_4(u))
| pred_attacker(u) ),
file('SWW951+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_T_in_3(u)) ),
file('SWW951+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_T_in_1(u)) ),
file('SWW951+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ pred_attacker(tuple_T_in_1(u))
| ~ pred_attacker(tuple_T_in_3(v))
| pred_attacker(tuple_T_out_4(name_objective)) ),
file('SWW951+1.p',unknown),
[] ).
cnf(67,plain,
~ pred_attacker(tuple_T_out_4(name_objective)),
inference(res,[status(thm),theory(equality)],[53,10]),
[iquote('0:Res:53.1,10.0')] ).
cnf(72,plain,
( ~ pred_attacker(tuple_T_in_3(u))
| ~ pred_attacker(tuple_T_in_1(v)) ),
inference(mrr,[status(thm)],[66,67]),
[iquote('0:MRR:66.2,67.0')] ).
cnf(97,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(tuple_T_in_1(v)) ),
inference(res,[status(thm),theory(equality)],[56,72]),
[iquote('0:Res:56.1,72.0')] ).
cnf(98,plain,
~ pred_attacker(tuple_T_in_1(u)),
inference(con,[status(thm)],[97]),
[iquote('0:Con:97.0')] ).
cnf(99,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[58,98]),
[iquote('0:MRR:58.1,98.0')] ).
cnf(100,plain,
$false,
inference(unc,[status(thm)],[99,12]),
[iquote('0:UnC:99.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.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 16:24:23 EDT 2022
% 0.13/0.34 % 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 32 clauses, backtracked 0 clauses, performed 0 splits and kept 76 clauses.
% 0.19/0.45 SPASS allocated 97719 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 1, length 12 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : co0 ax62 ax46 ax49 ax51 ax64
% 0.19/0.45
%------------------------------------------------------------------------------