TSTP Solution File: SWV383+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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 : Wed Jul 20 21:42:36 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 12 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
ok(triple(skc9,skc10,skc11)),
file('SWV383+1.p',unknown),
[] ).
cnf(7,axiom,
check_cpq(triple(skc9,skc10,skc11)),
file('SWV383+1.p',unknown),
[] ).
cnf(12,axiom,
~ check_cpq(triple(skc6,skc7,skc8)),
file('SWV383+1.p',unknown),
[] ).
cnf(23,axiom,
succ_cpq(triple(skc6,skc7,skc8),triple(skc9,skc10,skc11)),
file('SWV383+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ check_cpq(triple(u,v,w))
| ~ ok(triple(u,v,w))
| ~ succ_cpq(triple(x,y,z),triple(u,v,w))
| check_cpq(triple(x,y,z)) ),
file('SWV383+1.p',unknown),
[] ).
cnf(73,plain,
( ~ ok(triple(skc9,skc10,skc11))
| ~ check_cpq(triple(skc9,skc10,skc11))
| check_cpq(triple(skc6,skc7,skc8)) ),
inference(res,[status(thm),theory(equality)],[23,54]),
[iquote('0:Res:23.0,54.0')] ).
cnf(75,plain,
$false,
inference(mrr,[status(thm)],[73,6,7,12]),
[iquote('0:MRR:73.0,73.1,73.2,6.0,7.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 23:27:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.47
% 0.20/0.47 SPASS V 3.9
% 0.20/0.47 SPASS beiseite: Proof found.
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 56 clauses.
% 0.20/0.47 SPASS allocated 85369 KBytes.
% 0.20/0.47 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.47 0:00:00.03 for the input.
% 0.20/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.47 0:00:00.00 for inferences.
% 0.20/0.47 0:00:00.00 for the backtracking.
% 0.20/0.47 0:00:00.00 for the reduction.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Here is a proof with depth 1, length 7 :
% 0.20/0.47 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : l19_co l19_l20
% 0.20/0.47
%------------------------------------------------------------------------------