TSTP Solution File: SWV389+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV389+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:37 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ check_cpq(triple(skc3,skc4,skc5)),
file('SWV389+1.p',unknown),
[] ).
cnf(11,axiom,
check_cpq(removemin_cpq_eff(triple(skc3,skc4,skc5))),
file('SWV389+1.p',unknown),
[] ).
cnf(12,axiom,
ok(removemin_cpq_eff(triple(skc3,skc4,skc5))),
file('SWV389+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ ok(removemin_cpq_eff(triple(u,v,w)))
| ~ check_cpq(removemin_cpq_eff(triple(u,v,w)))
| check_cpq(triple(u,v,w)) ),
file('SWV389+1.p',unknown),
[] ).
cnf(60,plain,
( ~ check_cpq(removemin_cpq_eff(triple(skc3,skc4,skc5)))
| check_cpq(triple(skc3,skc4,skc5)) ),
inference(res,[status(thm),theory(equality)],[12,44]),
[iquote('0:Res:12.0,44.1')] ).
cnf(64,plain,
$false,
inference(mrr,[status(thm)],[60,11,10]),
[iquote('0:MRR:60.0,60.1,11.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV389+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n011.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 : Wed Jun 15 13:10:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.20/0.46 SPASS allocated 85358 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 1, length 6 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : l25_co l25_l40
% 0.20/0.46
%------------------------------------------------------------------------------