%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN070-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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:57 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 124 ( 54 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_7,axiom,
! [VAR_0,VAR_1] :
( ~ big_j(VAR_1,VAR_0)
| ~ big_h(VAR_0,VAR_1)
| ~ big_f(VAR_1)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_7) ).
cnf(c_1,plain,
( ~ big_j(B,A)
| ~ big_h(A,B)
| ~ big_f(B)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_7]) ).
fof(clause_2,axiom,
! [VAR_0] :
( big_g(VAR_0)
| big_h(f(VAR_0),VAR_0)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_2) ).
cnf(c_2,plain,
( big_g(A)
| big_h(f(A),A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_2]) ).
fof(clause_6,axiom,
! [VAR_0,VAR_1] :
( big_j(a,VAR_1)
| big_g(VAR_1)
| ~ big_f(VAR_1)
| big_g(VAR_0)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_6) ).
cnf(c_3,plain,
( big_j(a,B)
| big_g(B)
| ~ big_f(B)
| big_g(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_6]) ).
cnf(c_4,plain,
( big_g(A)
| ~ big_f(A)
| ~ big_j(A,f(A))
| ~ big_f(A)
| ~ big_f(f(A)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_5,plain,
( big_g(a)
| ~ big_f(a)
| ~ big_f(a)
| ~ big_f(f(a))
| big_g(f(a))
| ~ big_f(f(a))
| big_g(A)
| ~ big_f(A) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_23,plain,
( big_g(a)
| ~ big_f(a)
| ~ big_f(a)
| big_g(f(a))
| ~ big_f(f(a))
| big_g(A)
| ~ big_f(A) ),
inference(copy,[status(thm)],[c_5]) ).
cnf(c_6,plain,
( big_g(a)
| ~ big_f(a)
| big_g(f(a))
| ~ big_f(f(a))
| big_g(A)
| ~ big_f(A) ),
inference(copy,[status(thm)],[c_23]) ).
fof(clause_1,axiom,
! [VAR_0] :
( big_g(VAR_0)
| big_f(f(VAR_0))
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_1) ).
cnf(c_7,plain,
( big_g(A)
| big_f(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_3,axiom,
! [VAR_0] :
( big_g(VAR_0)
| ~ big_g(f(VAR_0))
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_3) ).
cnf(c_8,plain,
( big_g(A)
| ~ big_g(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_4,axiom,
! [VAR_0] :
( big_f(a)
| big_g(VAR_0)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_4) ).
cnf(c_9,plain,
( big_f(a)
| big_g(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_4]) ).
fof(clause_5,axiom,
! [VAR_0] :
( ~ big_g(a)
| big_g(VAR_0)
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_5) ).
cnf(c_10,plain,
( ~ big_g(a)
| big_g(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_5]) ).
fof(clause_8,axiom,
big_f(b),
file('theBenchmark.p',clause_8) ).
cnf(c_11,plain,
big_f(b),
inference(clausify,[status(thm)],[clause_8]) ).
fof(clause_9,axiom,
~ big_g(b),
file('theBenchmark.p',clause_9) ).
cnf(c_12,plain,
~ big_g(b),
inference(clausify,[status(thm)],[clause_9]) ).
cnf(c_24,plain,
( big_g(a)
| ~ big_f(a)
| big_g(f(a))
| big_g(f(a))
| ~ big_f(f(a)) ),
inference(factor,[status(thm)],[c_6]) ).
cnf(c_13,plain,
( big_g(a)
| ~ big_f(a)
| big_g(f(a))
| ~ big_f(f(a)) ),
inference(copy,[status(thm)],[c_24]) ).
cnf(c_25,plain,
( big_f(a)
| big_g(b) ),
inference(resolve,[status(thm)],[c_11,c_9]) ).
cnf(c_14,plain,
big_f(a),
inference(resolve,[status(thm)],[c_12,c_25]) ).
cnf(c_16,plain,
( big_g(a)
| big_g(f(a))
| ~ big_f(f(a)) ),
inference(resolve,[status(thm)],[c_14,c_13]) ).
cnf(c_26,plain,
( ~ big_g(a)
| big_g(b) ),
inference(resolve,[status(thm)],[c_10,c_11]) ).
cnf(c_17,plain,
~ big_g(a),
inference(resolve,[status(thm)],[c_26,c_12]) ).
cnf(c_19,plain,
( big_g(f(a))
| ~ big_f(f(a)) ),
inference(resolve,[status(thm)],[c_17,c_16]) ).
cnf(c_27,plain,
( big_g(a)
| big_f(f(a)) ),
inference(resolve,[status(thm)],[c_14,c_7]) ).
cnf(c_20,plain,
big_f(f(a)),
inference(resolve,[status(thm)],[c_17,c_27]) ).
cnf(c_21,plain,
big_g(f(a)),
inference(resolve,[status(thm)],[c_20,c_19]) ).
cnf(c_28,plain,
( big_g(a)
| ~ big_g(f(a)) ),
inference(resolve,[status(thm)],[c_8,c_14]) ).
cnf(c_29,plain,
~ big_g(f(a)),
inference(resolve,[status(thm)],[c_28,c_17]) ).
cnf(c_22,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN070-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n002.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sat Sep 26 17:11:58 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.38 % Process 2277584 was started by sandbox2 on n002,
% 0.09/5.38 % Sat Sep 26 17:11:58 2026
% 0.09/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.39
% 0.09/5.39 % From the command line: assign(max_seconds, 300).
% 0.15/5.40
% 0.15/5.40 % SZS status Unsatisfiable for theBenchmark
% 0.15/5.40
% 0.15/5.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.40 % Length of proof is 20.
% 0.15/5.40 % Level of proof is 8.
% 0.15/5.40 % Maximum clause weight is 14.000.
% 0.15/5.40 % Given clauses 8.
% 0.15/5.40
% 0.15/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------