%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET829-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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 08:37:03 AM UTC 2026
% Result : Unsatisfiable 0.04s 0.75s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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; 4 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_1,axiom,
c_lessequals(v_X,v_Z,tc_set(t_a)),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_1,plain,
c_lessequals(v_X,v_Z,tc_set(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_Set_OsubsetD_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_in(VAR_0,VAR_3,VAR_2)
| ~ c_lessequals(VAR_1,VAR_3,tc_set(VAR_2))
| ~ c_in(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(c_2,plain,
( c_in(A,D,C)
| ~ c_lessequals(B,D,tc_set(C))
| ~ c_in(A,B,C) ),
inference(clausify,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_3,plain,
( c_in(A,v_Z,t_a)
| ~ c_in(A,v_X,t_a) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(cls_conjecture_3,axiom,
~ c_in(v_x,v_Z,t_a),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(c_4,plain,
~ c_in(v_x,v_Z,t_a),
inference(clausify,[status(thm)],[cls_conjecture_3]) ).
fof(cls_conjecture_2,axiom,
c_in(v_x,v_X,t_a),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_5,plain,
c_in(v_x,v_X,t_a),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
cnf(c_6,plain,
~ c_in(v_x,v_X,t_a),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_7,plain,
$false,
inference(resolve,[status(thm)],[c_6,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET829-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.73 % Computer : n012.cluster.edu
% 0.04/0.73 % Model : x86_64 x86_64
% 0.04/0.73 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.73 % Memory : 8046.5625MB
% 0.04/0.73 % OS : Linux 6.8.0-71-generic
% 0.04/0.73 % CPULimit : 300
% 0.04/0.73 % WCLimit : 300
% 0.04/0.73 % DateTime : Sat Sep 26 08:19:22 UTC 2026
% 0.04/0.74 % CPUTime :
% 0.04/0.74 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/0.74 % Process 116176 was started by sandbox on n012,
% 0.04/0.74 % Sat Sep 26 08:19:22 2026
% 0.04/0.74 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.04/0.74
% 0.04/0.74 % From the command line: assign(max_seconds, 300).
% 0.04/0.75
% 0.04/0.75 % SZS status Unsatisfiable for theBenchmark
% 0.04/0.75
% 0.04/0.75 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.04/0.75 % Length of proof is 7.
% 0.04/0.75 % Level of proof is 3.
% 0.04/0.75 % Maximum clause weight is 8.000.
% 0.04/0.75 % Given clauses 2.
% 0.04/0.75
% 0.04/0.75 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------