%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : ANA010-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 : n013.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 06:51:06 AM UTC 2026
% Result : Unsatisfiable 0.07s 0.37s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 57 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 30 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
! [VAR_0] :
( class_OrderedGroup_Olordered__ab__group__abs(VAR_0)
| ~ class_Ring__and__Field_Oordered__idom(VAR_0) ),
file('theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_1,plain,
( class_OrderedGroup_Olordered__ab__group__abs(A)
| ~ class_Ring__and__Field_Oordered__idom(A) ),
inference(clausify,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).
fof(clsrel_OrderedGroup_Olordered__ab__group__abs_17,axiom,
! [VAR_0] :
( class_Orderings_Oorder(VAR_0)
| ~ class_OrderedGroup_Olordered__ab__group__abs(VAR_0) ),
file('theBenchmark.p',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
cnf(c_2,plain,
( class_Orderings_Oorder(A)
| ~ class_OrderedGroup_Olordered__ab__group__abs(A) ),
inference(clausify,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_17]) ).
fof(cls_OrderedGroup_Oabs__of__nonneg_0,axiom,
! [VAR_0,VAR_1] :
( c_HOL_Oabs(VAR_1,VAR_0) = VAR_1
| ~ c_lessequals(c_0,VAR_1,VAR_0)
| ~ class_OrderedGroup_Olordered__ab__group__abs(VAR_0) ),
file('theBenchmark.p',cls_OrderedGroup_Oabs__of__nonneg_0) ).
cnf(c_3,plain,
( c_HOL_Oabs(B,A) = B
| ~ c_lessequals(c_0,B,A)
| ~ class_OrderedGroup_Olordered__ab__group__abs(A) ),
inference(clausify,[status(thm)],[cls_OrderedGroup_Oabs__of__nonneg_0]) ).
fof(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( c_lessequals(VAR_3,VAR_2,VAR_0)
| ~ c_lessequals(VAR_3,VAR_1,VAR_0)
| ~ c_lessequals(VAR_1,VAR_2,VAR_0)
| ~ class_Orderings_Oorder(VAR_0) ),
file('theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(c_4,plain,
( c_lessequals(D,C,A)
| ~ c_lessequals(D,B,A)
| ~ c_lessequals(B,C,A)
| ~ class_Orderings_Oorder(A) ),
inference(clausify,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_5,plain,
( class_Orderings_Oorder(A)
| ~ class_Ring__and__Field_Oordered__idom(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(tfree_tcs,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file('theBenchmark.p',tfree_tcs) ).
cnf(c_6,plain,
class_Ring__and__Field_Oordered__idom(t_b),
inference(clausify,[status(thm)],[tfree_tcs]) ).
fof(cls_Ring__and__Field_Oabs__mult_0,axiom,
! [VAR_0,VAR_1,VAR_2] :
( c_HOL_Oabs(c_times(VAR_1,VAR_2,VAR_0),VAR_0) = c_times(c_HOL_Oabs(VAR_1,VAR_0),c_HOL_Oabs(VAR_2,VAR_0),VAR_0)
| ~ class_Ring__and__Field_Oordered__idom(VAR_0) ),
file('theBenchmark.p',cls_Ring__and__Field_Oabs__mult_0) ).
cnf(c_7,plain,
( c_HOL_Oabs(c_times(B,C,A),A) = c_times(c_HOL_Oabs(B,A),c_HOL_Oabs(C,A),A)
| ~ class_Ring__and__Field_Oordered__idom(A) ),
inference(clausify,[status(thm)],[cls_Ring__and__Field_Oabs__mult_0]) ).
cnf(c_8,plain,
( ~ class_Ring__and__Field_Oordered__idom(C)
| c_lessequals(D,B,C)
| ~ c_lessequals(D,A,C)
| ~ c_lessequals(A,B,C) ),
inference(resolve,[status(thm)],[c_4,c_5]) ).
cnf(c_9,plain,
( c_HOL_Oabs(B,A) = B
| ~ c_lessequals(c_0,B,A)
| ~ class_Ring__and__Field_Oordered__idom(A) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_10,plain,
( c_HOL_Oabs(A,t_b) = A
| ~ c_lessequals(c_0,A,t_b) ),
inference(resolve,[status(thm)],[c_9,c_6]) ).
cnf(c_11,plain,
( c_lessequals(C,B,t_b)
| ~ c_lessequals(C,A,t_b)
| ~ c_lessequals(A,B,t_b) ),
inference(resolve,[status(thm)],[c_6,c_8]) ).
cnf(c_12,plain,
c_HOL_Oabs(c_times(A,B,t_b),t_b) = c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b),
inference(resolve,[status(thm)],[c_6,c_7]) ).
cnf(c_13,plain,
c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b) = c_HOL_Oabs(c_times(A,B,t_b),t_b),
inference(copy,[status(thm)],[c_12]) ).
fof(cls_conjecture_2,axiom,
! [VAR_0] : ~ c_lessequals(v_f(v_x(VAR_0)),c_times(VAR_0,c_HOL_Oabs(v_g(v_x(VAR_0)),t_b),t_b),t_b),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_14,plain,
~ c_lessequals(v_f(v_x(A)),c_times(A,c_HOL_Oabs(v_g(v_x(A)),t_b),t_b),t_b),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
fof(cls_conjecture_1,axiom,
! [VAR_0] : c_lessequals(v_f(VAR_0),c_times(v_c,v_g(VAR_0),t_b),t_b),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_15,plain,
c_lessequals(v_f(A),c_times(v_c,v_g(A),t_b),t_b),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_conjecture_0,axiom,
! [VAR_0] : c_lessequals(c_0,v_f(VAR_0),t_b),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_16,plain,
c_lessequals(c_0,v_f(A),t_b),
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
cnf(c_17,plain,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(A,t_b))),c_HOL_Oabs(c_times(A,v_g(v_x(c_HOL_Oabs(A,t_b))),t_b),t_b),t_b),
inference(paramod,[status(thm)],[c_13,c_14]) ).
cnf(c_32,plain,
( c_lessequals(A,c_times(v_c,v_g(B),t_b),t_b)
| ~ c_lessequals(A,v_f(B),t_b) ),
inference(resolve,[status(thm)],[c_11,c_15]) ).
cnf(c_19,plain,
c_lessequals(c_0,c_times(v_c,v_g(A),t_b),t_b),
inference(resolve,[status(thm)],[c_32,c_16]) ).
cnf(c_26,plain,
c_HOL_Oabs(c_times(v_c,v_g(A),t_b),t_b) = c_times(v_c,v_g(A),t_b),
inference(resolve,[status(thm)],[c_10,c_19]) ).
cnf(c_30,plain,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(v_c,t_b))),c_times(v_c,v_g(v_x(c_HOL_Oabs(v_c,t_b))),t_b),t_b),
inference(paramod,[status(thm)],[c_26,c_17]) ).
cnf(c_31,plain,
$false,
inference(resolve,[status(thm)],[c_30,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ANA010-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 : n013.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.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 26 22:03:51 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35 % Process 3647042 was started by sandbox on n013,
% 0.07/0.35 % Sat Sep 26 22:03:51 2026
% 0.07/0.35 % 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.07/0.37
% 0.07/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.37
% 0.07/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.07/0.37 % Length of proof is 21.
% 0.07/0.37 % Level of proof is 7.
% 0.07/0.37 % Maximum clause weight is 17.000.
% 0.07/0.37 % Given clauses 12.
% 0.07/0.37
% 0.07/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------