%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:07:56 PM UTC 2026
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% 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; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p201(skc3),
file('LCL648+1.001.p',unknown),
[] ).
cnf(2,axiom,
p101(skc3),
file('LCL648+1.001.p',unknown),
[] ).
cnf(3,axiom,
r1(skc2,skc3),
file('LCL648+1.001.p',unknown),
[] ).
cnf(4,axiom,
( ~ p101(u)
| ~ p201(u)
| ~ r1(skc2,u) ),
file('LCL648+1.001.p',unknown),
[] ).
cnf(7,plain,
( ~ p101(skc3)
| ~ p201(skc3) ),
inference(res,[status(thm),theory(equality)],[3,4]),
[iquote('0:Res:3.0,4.2')] ).
cnf(8,plain,
$false,
inference(ssi,[status(thm)],[7,2,1]),
[iquote('0:SSi:7.1,7.0,2.0,1.0,2.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.02/0.35 % Computer : n007.cluster.edu
% 0.02/0.35 % Model : x86_64 x86_64
% 0.02/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.35 % Memory : 8046.5625MB
% 0.02/0.35 % OS : Linux 6.8.0-71-generic
% 0.02/0.35 % CPULimit : 300
% 0.02/0.35 % WCLimit : 300
% 0.02/0.35 % DateTime : Fri Sep 4 12:24:40 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.21/0.52
% 0.21/0.52 SPASS V 3.9
% 0.21/0.52 SPASS beiseite: Proof found.
% 0.21/0.52 % SZS status Theorem
% 0.21/0.52 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 5 clauses.
% 0.21/0.52 SPASS allocated 97553 KBytes.
% 0.21/0.52 SPASS spent 0:00:00.14 on the problem.
% 0.21/0.52 0:00:00.06 for the input.
% 0.21/0.52 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.52 0:00:00.00 for inferences.
% 0.21/0.52 0:00:00.00 for the backtracking.
% 0.21/0.52 0:00:00.00 for the reduction.
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 Here is a proof with depth 1, length 6 :
% 0.21/0.52 % SZS output start Refutation
% See solution above
% 0.21/0.52 Formulae used in the proof : main
% 0.21/0.52
%------------------------------------------------------------------------------