%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL436-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:31 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.79s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(u,c_PropLog_Opl_Oop_A_N_62(v,w,x),x),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(u,v,x),c_PropLog_Opl_Oop_A_N_62(u,w,x),x),x),c_PropLog_Othms(y,x),tc_PropLog_Opl(x)),
file('LCL436-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_in(u,c_PropLog_Othms(v,w),tc_PropLog_Opl(w))
| c_in(c_PropLog_Opl_Oop_A_N_62(x,u,w),c_PropLog_Othms(v,w),tc_PropLog_Opl(w)) ),
file('LCL436-1.p',unknown),
[] ).
cnf(7,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v,c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_r,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(v_pa,v_r,t_a),t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL436-1.p',unknown),
[] ).
cnf(1387,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_r,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),c_PropLog_Opl_Oop_A_N_62(v_pa,v_r,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(res,[status(thm),theory(equality)],[6,7]),
[iquote('0:Res:6.1,7.0')] ).
cnf(1391,plain,
$false,
inference(mrr,[status(thm)],[1387,4]),
[iquote('0:MRR:1387.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL436-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.38 % Computer : n003.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sat Sep 5 02:52:20 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.44/0.79
% 0.44/0.79 SPASS V 3.9
% 0.44/0.79 SPASS beiseite: Proof found.
% 0.44/0.79 % SZS status Theorem
% 0.44/0.79 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.79 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 1338 clauses.
% 0.44/0.79 SPASS allocated 77787 KBytes.
% 0.44/0.79 SPASS spent 0:00:00.38 on the problem.
% 0.44/0.79 0:00:00.11 for the input.
% 0.44/0.79 0:00:00.00 for the FLOTTER CNF translation.
% 0.44/0.79 0:00:00.00 for inferences.
% 0.44/0.79 0:00:00.00 for the backtracking.
% 0.44/0.79 0:00:00.12 for the reduction.
% 0.44/0.79
% 0.44/0.79
% 0.44/0.79 Here is a proof with depth 1, length 5 :
% 0.44/0.79 % SZS output start Refutation
% See solution above
% 0.44/0.79 Formulae used in the proof : cls_PropLog_Othms_OS_0 cls_PropLog_Oweaken__right_0 cls_conjecture_0
% 0.44/0.79
%------------------------------------------------------------------------------