%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL432-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 : n002.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:53 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.38s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_PropLog_Ocompleteness__0_0,axiom,
! [VAR_0,VAR_1] :
( c_in(VAR_0,c_PropLog_Othms(c_emptyset,VAR_1),tc_PropLog_Opl(VAR_1))
| ~ c_PropLog_Osat(c_emptyset,VAR_0,VAR_1) ),
file('theBenchmark.p',cls_PropLog_Ocompleteness__0_0) ).
cnf(c_1,plain,
( c_in(A,c_PropLog_Othms(c_emptyset,B),tc_PropLog_Opl(B))
| ~ c_PropLog_Osat(c_emptyset,A,B) ),
inference(clausify,[status(thm)],[cls_PropLog_Ocompleteness__0_0]) ).
fof(cls_conjecture_0,axiom,
c_PropLog_Osat(c_emptyset,v_x,t_a),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_2,plain,
c_PropLog_Osat(c_emptyset,v_x,t_a),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_3,plain,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
cnf(c_4,plain,
c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_5,plain,
$false,
inference(resolve,[status(thm)],[c_3,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL432-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.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 22:35:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 171116 was started by sandbox2 on n002,
% 0.11/0.38 % Fri Sep 25 22:35:19 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.11/0.38
% 0.11/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.38
% 0.11/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.38 % Length of proof is 5.
% 0.11/0.38 % Level of proof is 2.
% 0.11/0.38 % Maximum clause weight is 0.000.
% 0.11/0.38 % Given clauses 0.
% 0.11/0.38
% 0.11/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------