%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ063-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 : n005.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:23:15 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 4 ( 1 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_1,plain,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_2,axiom,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_2,plain,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
fof(cls_Set_OUn__empty__left_0,axiom,
! [VAR_0,VAR_1] : c_union(c_emptyset,VAR_0,VAR_1) = VAR_0,
file('theBenchmark.p',cls_Set_OUn__empty__left_0) ).
cnf(c_3,plain,
c_union(c_emptyset,A,B) = A,
inference(clausify,[status(thm)],[cls_Set_OUn__empty__left_0]) ).
cnf(c_4,plain,
~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(paramod,[status(thm)],[c_3,c_2]) ).
cnf(c_5,plain,
$false,
inference(resolve,[status(thm)],[c_4,c_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ063-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n005.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 26 05:10:17 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.34 % Process 1266128 was started by sandbox on n005,
% 0.07/0.34 % Sat Sep 26 05:10:17 2026
% 0.07/0.34 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.07/0.35
% 0.07/0.35 % From the command line: assign(max_seconds, 300).
% 0.13/0.36
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.36 % Length of proof is 5.
% 0.13/0.36 % Level of proof is 2.
% 0.13/0.36 % Maximum clause weight is 10.000.
% 0.13/0.36 % Given clauses 0.
% 0.13/0.36
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------