%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL435-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:30 PM UTC 2026
% Result : Unsatisfiable 0.45s 0.76s
% Output : Refutation 0.45s
% 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 : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(u,c_PropLog_Opl_Oop_A_N_62(v,u,w),w),c_PropLog_Othms(x,w),tc_PropLog_Opl(w)),
file('LCL435-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('LCL435-1.p',unknown),
[] ).
cnf(7,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v,c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL435-1.p',unknown),
[] ).
cnf(1387,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,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,2]),
[iquote('0:MRR:1387.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL435-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 22:45:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.45/0.76
% 0.45/0.76 SPASS V 3.9
% 0.45/0.76 SPASS beiseite: Proof found.
% 0.45/0.76 % SZS status Theorem
% 0.45/0.76 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.76 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 1338 clauses.
% 0.45/0.76 SPASS allocated 77785 KBytes.
% 0.45/0.76 SPASS spent 0:00:00.38 on the problem.
% 0.45/0.76 0:00:00.11 for the input.
% 0.45/0.76 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/0.76 0:00:00.00 for inferences.
% 0.45/0.76 0:00:00.00 for the backtracking.
% 0.45/0.76 0:00:00.12 for the reduction.
% 0.45/0.76
% 0.45/0.76
% 0.45/0.76 Here is a proof with depth 1, length 5 :
% 0.45/0.76 % SZS output start Refutation
% See solution above
% 0.45/0.76 Formulae used in the proof : cls_PropLog_Othms_OK_0 cls_PropLog_Oweaken__right_0 cls_conjecture_0
% 0.45/0.76
%------------------------------------------------------------------------------