%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN061-1 : TPTP v9.3.1. Released v1.0.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 09:36:55 AM UTC 2026
% Result : Unsatisfiable 0.17s 5.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_4,axiom,
big_f(a),
file('theBenchmark.p',clause_4) ).
cnf(c_1,plain,
big_f(a),
inference(clausify,[status(thm)],[clause_4]) ).
fof(clause_2,axiom,
! [VAR_0] :
( ~ big_h(VAR_0)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_2) ).
cnf(c_2,plain,
( ~ big_h(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_2]) ).
cnf(c_4,plain,
~ big_h(a),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(clause_5,axiom,
! [VAR_0] :
( big_j(VAR_0)
| big_h(VAR_0) ),
file('theBenchmark.p',clause_5) ).
cnf(c_5,plain,
( big_j(A)
| big_h(A) ),
inference(clausify,[status(thm)],[clause_5]) ).
fof(clause_3,axiom,
big_i(a),
file('theBenchmark.p',clause_3) ).
cnf(c_6,plain,
big_i(a),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_6,axiom,
! [VAR_0] :
( ~ big_j(VAR_0)
| ~ big_i(VAR_0) ),
file('theBenchmark.p',clause_6) ).
cnf(c_7,plain,
( ~ big_j(A)
| ~ big_i(A) ),
inference(clausify,[status(thm)],[clause_6]) ).
cnf(c_8,plain,
big_j(a),
inference(resolve,[status(thm)],[c_4,c_5]) ).
cnf(c_9,plain,
~ big_j(a),
inference(resolve,[status(thm)],[c_6,c_7]) ).
cnf(c_10,plain,
$false,
inference(resolve,[status(thm)],[c_8,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN061-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/5.44 % Computer : n013.cluster.edu
% 0.17/5.44 % Model : x86_64 x86_64
% 0.17/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44 % Memory : 8046.5625MB
% 0.17/5.44 % OS : Linux 6.8.0-71-generic
% 0.17/5.44 % CPULimit : 300
% 0.17/5.44 % WCLimit : 300
% 0.17/5.44 % DateTime : Sat Sep 26 17:07:27 UTC 2026
% 0.17/5.44 % CPUTime :
% 0.17/5.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/5.44 % Process 3219771 was started by sandbox on n013,
% 0.17/5.44 % Sat Sep 26 17:07:27 2026
% 0.17/5.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/5.45
% 0.17/5.45 % From the command line: assign(max_seconds, 300).
% 0.17/5.45
% 0.17/5.45 % SZS status Unsatisfiable for theBenchmark
% 0.17/5.45
% 0.17/5.45 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/5.45 % Length of proof is 9.
% 0.17/5.45 % Level of proof is 3.
% 0.17/5.45 % Maximum clause weight is 0.000.
% 0.17/5.45 % Given clauses 0.
% 0.17/5.45
% 0.17/5.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------