%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL446-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 : Sun Sep 27 07:58:57 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 8 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_PropLog_Othms_OK_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] : c_in(c_PropLog_Opl_Oop_A_N_62(VAR_0,c_PropLog_Opl_Oop_A_N_62(VAR_1,VAR_0,VAR_2),VAR_2),c_PropLog_Othms(VAR_3,VAR_2),tc_PropLog_Opl(VAR_2)),
file('theBenchmark.p',cls_PropLog_Othms_OK_0) ).
cnf(c_2,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,A,C),C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),
inference(clausify,[status(thm)],[cls_PropLog_Othms_OK_0]) ).
fof(cls_PropLog_Othms_OMP_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_in(VAR_3,c_PropLog_Othms(VAR_1,VAR_2),tc_PropLog_Opl(VAR_2))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(VAR_0,VAR_3,VAR_2),c_PropLog_Othms(VAR_1,VAR_2),tc_PropLog_Opl(VAR_2))
| ~ c_in(VAR_0,c_PropLog_Othms(VAR_1,VAR_2),tc_PropLog_Opl(VAR_2)) ),
file('theBenchmark.p',cls_PropLog_Othms_OMP_0) ).
cnf(c_3,plain,
( c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| ~ c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) ),
inference(clausify,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).
fof(cls_PropLog_Othms_OS_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(VAR_0,c_PropLog_Opl_Oop_A_N_62(VAR_1,VAR_2,VAR_3),VAR_3),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(VAR_0,VAR_1,VAR_3),c_PropLog_Opl_Oop_A_N_62(VAR_0,VAR_2,VAR_3),VAR_3),VAR_3),c_PropLog_Othms(VAR_4,VAR_3),tc_PropLog_Opl(VAR_3)),
file('theBenchmark.p',cls_PropLog_Othms_OS_0) ).
cnf(c_4,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,C,D),D),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,B,D),c_PropLog_Opl_Oop_A_N_62(A,C,D),D),D),c_PropLog_Othms(E,D),tc_PropLog_Opl(D)),
inference(clausify,[status(thm)],[cls_PropLog_Othms_OS_0]) ).
cnf(c_12,plain,
( c_in(D,c_PropLog_Othms(E,C),tc_PropLog_Opl(C))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,A,C),C),D,C),c_PropLog_Othms(E,C),tc_PropLog_Opl(C)) ),
inference(resolve,[status(thm)],[c_3,c_2]) ).
cnf(c_8,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,A,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(resolve,[status(thm)],[c_12,c_1]) ).
cnf(c_13,plain,
( c_in(D,c_PropLog_Othms(E,C),tc_PropLog_Opl(C))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Oop_A_N_62(B,A,C),C),D,C),c_PropLog_Othms(E,C),tc_PropLog_Opl(C)) ),
inference(resolve,[status(thm)],[c_3,c_2]) ).
cnf(c_10,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Opl_Oop_A_N_62(A,A,C),C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),
inference(resolve,[status(thm)],[c_13,c_4]) ).
cnf(c_11,plain,
$false,
inference(resolve,[status(thm)],[c_10,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL446-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 22:34:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 3091830 was started by sandbox2 on n011,
% 0.10/0.37 % Fri Sep 25 22:34:44 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 7.
% 0.10/0.39 % Level of proof is 2.
% 0.10/0.39 % Maximum clause weight is 25.000.
% 0.10/0.39 % Given clauses 4.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------