%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET836-1 : 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 : n020.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:05 AM UTC 2026
% Result : Unsatisfiable 24.86s 3.67s
% Output : CNFRefutation 24.86s
% 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 : 12 ( 7 ~; 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_3,axiom,
~ c_in(v_x,v_X,t_a),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(c_1545,plain,
~ c_in(v_x,v_X,t_a),
inference(clausify,[status(thm)],[cls_conjecture_3]) ).
fof(cls_conjecture_2,axiom,
c_in(v_x,v_Z,t_a),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_1546,plain,
c_in(v_x,v_Z,t_a),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
fof(cls_conjecture_1,axiom,
c_lessequals(v_Z,v_X,tc_set(t_a)),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_1547,plain,
c_lessequals(v_Z,v_X,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_1746,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_2353,plain,
( c_in(A,v_X,t_a)
| ~ c_in(A,v_Z,t_a) ),
inference(resolve,[status(thm)],[c_1746,c_1547]) ).
cnf(c_3346,plain,
c_in(v_x,v_X,t_a),
inference(resolve,[status(thm)],[c_2353,c_1546]) ).
cnf(c_3345,plain,
$false,
inference(resolve,[status(thm)],[c_1545,c_3346]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET836-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n020.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sat Sep 26 08:20:49 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.45 % Process 1069653 was started by sandbox2 on n020,
% 0.17/0.45 % Sat Sep 26 08:20:49 2026
% 0.17/0.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.47
% 0.17/0.47 % From the command line: assign(max_seconds, 300).
% 24.86/3.67
% 24.86/3.67 % given #500 (I,wt=9): 1627 -class_Ring__and__Field_Oordered__field(A) | class_HOL_Oinverse(A) # tptp_name(clsrel_Ring__and__Field_Oordered__field_1) # clausal_fof(1). [assumption].
% 24.86/3.67
% 24.86/3.67 % SZS status Unsatisfiable for theBenchmark
% 24.86/3.67
% 24.86/3.67 % Proof 1 at 3.05 (+ 0.11) seconds.
% 24.86/3.67 % Length of proof is 6.
% 24.86/3.67 % Level of proof is 2.
% 24.86/3.67 % Maximum clause weight is 23.000.
% 24.86/3.67 % Given clauses 966.
% 24.86/3.67
% 24.86/3.67 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------