%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : ANA042-1 : 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 06:51:12 AM UTC 2026
% Result : Unsatisfiable 19.21s 2.85s
% Output : CNFRefutation 19.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 6 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_conjecture_1,axiom,
! [VAR_0,VAR_1] : c_lessequals(c_HOL_Oabs(v_f(VAR_0,VAR_1),t_c),c_times(v_x,v_h(VAR_0,VAR_1),t_c),t_c),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_1223,plain,
c_lessequals(c_HOL_Oabs(v_f(A,B),t_c),c_times(v_x,v_h(A,B),t_c),t_c),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_conjecture_3,axiom,
! [VAR_0] : ~ c_lessequals(c_HOL_Oabs(v_f(v_xa(VAR_0),v_xb(VAR_0)),t_c),c_times(VAR_0,v_h(v_xa(VAR_0),v_xb(VAR_0)),t_c),t_c),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(c_1225,plain,
~ c_lessequals(c_HOL_Oabs(v_f(v_xa(A),v_xb(A)),t_c),c_times(A,v_h(v_xa(A),v_xb(A)),t_c),t_c),
inference(clausify,[status(thm)],[cls_conjecture_3]) ).
cnf(c_1226,plain,
$false,
inference(resolve,[status(thm)],[c_1225,c_1223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ANA042-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Sat Sep 26 22:08:50 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.31 % Process 1596366 was started by sandbox on n012,
% 0.03/0.31 % Sat Sep 26 22:08:50 2026
% 0.03/0.31 % 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).
% 19.21/2.85
% 19.21/2.85 % SZS status Unsatisfiable for theBenchmark
% 19.21/2.85
% 19.21/2.85 % Proof 1 at 2.47 (+ 0.02) seconds.
% 19.21/2.85 % Length of proof is 3.
% 19.21/2.85 % Level of proof is 1.
% 19.21/2.85 % Maximum clause weight is 37.000.
% 19.21/2.85 % Given clauses 0.
% 19.21/2.85
% 19.21/2.85 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------