%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN566-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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:38:51 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 20 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 31 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p2_2,axiom,
! [VAR_0] : p2(VAR_0,VAR_0),
file('theBenchmark.p',p2_2) ).
cnf(c_2,plain,
p2(A,A),
inference(clausify,[status(thm)],[p2_2]) ).
fof(p3_3,axiom,
! [VAR_0] : p3(VAR_0,VAR_0),
file('theBenchmark.p',p3_3) ).
cnf(c_3,plain,
p3(A,A),
inference(clausify,[status(thm)],[p3_3]) ).
fof(p7_4,axiom,
! [VAR_0] : p7(VAR_0,VAR_0),
file('theBenchmark.p',p7_4) ).
cnf(c_4,plain,
p7(A,A),
inference(clausify,[status(thm)],[p7_4]) ).
fof(p10_5,axiom,
p10(c15,c11),
file('theBenchmark.p',p10_5) ).
cnf(c_5,plain,
p10(c15,c11),
inference(clausify,[status(thm)],[p10_5]) ).
fof(p8_6,axiom,
p8(c12,c13),
file('theBenchmark.p',p8_6) ).
cnf(c_6,plain,
p8(c12,c13),
inference(clausify,[status(thm)],[p8_6]) ).
fof(p2_7,axiom,
p2(c14,f6(c15)),
file('theBenchmark.p',p2_7) ).
cnf(c_7,plain,
p2(c14,f6(c15)),
inference(clausify,[status(thm)],[p2_7]) ).
fof(p3_8,axiom,
p3(c13,f4(c14)),
file('theBenchmark.p',p3_8) ).
cnf(c_8,plain,
p3(c13,f4(c14)),
inference(clausify,[status(thm)],[p3_8]) ).
fof(p3_9,axiom,
! [VAR_0,VAR_1] :
( ~ p2(VAR_0,VAR_1)
| p3(f4(VAR_0),f4(VAR_1)) ),
file('theBenchmark.p',p3_9) ).
cnf(c_9,plain,
( ~ p2(A,B)
| p3(f4(A),f4(B)) ),
inference(clausify,[status(thm)],[p3_9]) ).
fof(p8_16,axiom,
! [VAR_0,VAR_1] :
( ~ p8(VAR_0,f4(f6(VAR_1)))
| p8(VAR_0,f4(f5(VAR_1))) ),
file('theBenchmark.p',p8_16) ).
cnf(c_16,plain,
( ~ p8(A,f4(f6(B)))
| p8(A,f4(f5(B))) ),
inference(clausify,[status(thm)],[p8_16]) ).
fof(p8_18,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p3(VAR_3,VAR_1)
| ~ p8(VAR_2,VAR_3)
| ~ p7(VAR_2,VAR_0)
| p8(VAR_0,VAR_1) ),
file('theBenchmark.p',p8_18) ).
cnf(c_18,plain,
( ~ p3(D,B)
| ~ p8(C,D)
| ~ p7(C,A)
| p8(A,B) ),
inference(clausify,[status(thm)],[p8_18]) ).
fof(not_p10_19,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_2,f5(VAR_0))
| ~ p3(VAR_1,f4(VAR_2))
| ~ p8(c12,VAR_1)
| ~ p10(VAR_0,c11) ),
file('theBenchmark.p',not_p10_19) ).
cnf(c_19,plain,
( ~ p2(C,f5(A))
| ~ p3(B,f4(C))
| ~ p8(c12,B)
| ~ p10(A,c11) ),
inference(clausify,[status(thm)],[not_p10_19]) ).
cnf(c_20,plain,
p3(f4(c14),f4(f6(c15))),
inference(resolve,[status(thm)],[c_9,c_7]) ).
cnf(c_57,plain,
( ~ p3(C,B)
| ~ p8(A,C)
| p8(A,B) ),
inference(resolve,[status(thm)],[c_18,c_4]) ).
cnf(c_58,plain,
( ~ p3(c13,A)
| p8(c12,A) ),
inference(resolve,[status(thm)],[c_57,c_6]) ).
cnf(c_25,plain,
p8(c12,f4(c14)),
inference(resolve,[status(thm)],[c_58,c_8]) ).
cnf(c_59,plain,
( ~ p2(B,f5(c15))
| ~ p3(A,f4(B))
| ~ p8(c12,A) ),
inference(resolve,[status(thm)],[c_19,c_5]) ).
cnf(c_60,plain,
( ~ p2(A,f5(c15))
| ~ p8(c12,f4(A)) ),
inference(resolve,[status(thm)],[c_59,c_3]) ).
cnf(c_38,plain,
~ p8(c12,f4(f5(c15))),
inference(resolve,[status(thm)],[c_60,c_2]) ).
cnf(c_46,plain,
~ p8(c12,f4(f6(c15))),
inference(resolve,[status(thm)],[c_38,c_16]) ).
cnf(c_61,plain,
( ~ p3(C,B)
| ~ p8(A,C)
| p8(A,B) ),
inference(resolve,[status(thm)],[c_18,c_4]) ).
cnf(c_62,plain,
( ~ p3(f4(c14),A)
| p8(c12,A) ),
inference(resolve,[status(thm)],[c_61,c_25]) ).
cnf(c_63,plain,
p8(c12,f4(f6(c15))),
inference(resolve,[status(thm)],[c_62,c_20]) ).
cnf(c_56,plain,
$false,
inference(resolve,[status(thm)],[c_46,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN566-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n026.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 18:16:55 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 1649917 was started by sandbox on n026,
% 0.17/0.44 % Sat Sep 26 18:16:55 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.47 % Length of proof is 16.
% 0.17/0.47 % Level of proof is 3.
% 0.17/0.47 % Maximum clause weight is 14.000.
% 0.17/0.47 % Given clauses 27.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------