%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN563-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 : n005.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:50 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 25 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 34 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p2_1,axiom,
! [VAR_0] : p2(VAR_0,VAR_0),
file('theBenchmark.p',p2_1) ).
cnf(c_1,plain,
p2(A,A),
inference(clausify,[status(thm)],[p2_1]) ).
fof(p6_2,axiom,
! [VAR_0] : p6(VAR_0,VAR_0),
file('theBenchmark.p',p6_2) ).
cnf(c_2,plain,
p6(A,A),
inference(clausify,[status(thm)],[p6_2]) ).
fof(p2_4,axiom,
p2(f4(c7),f4(c8)),
file('theBenchmark.p',p2_4) ).
cnf(c_4,plain,
p2(f4(c7),f4(c8)),
inference(clausify,[status(thm)],[p2_4]) ).
fof(not_p6_5,axiom,
~ p6(f4(c7),f3(f4(c8))),
file('theBenchmark.p',not_p6_5) ).
cnf(c_5,plain,
~ p6(f4(c7),f3(f4(c8))),
inference(clausify,[status(thm)],[not_p6_5]) ).
fof(p5_7,axiom,
! [VAR_0] : p5(f3(f3(VAR_0)),f3(f4(VAR_0))),
file('theBenchmark.p',p5_7) ).
cnf(c_7,plain,
p5(f3(f3(A)),f3(f4(A))),
inference(clausify,[status(thm)],[p5_7]) ).
fof(p6_9,axiom,
! [VAR_0] :
( ~ p6(c7,VAR_0)
| p6(c7,f3(VAR_0)) ),
file('theBenchmark.p',p6_9) ).
cnf(c_9,plain,
( ~ p6(c7,A)
| p6(c7,f3(A)) ),
inference(clausify,[status(thm)],[p6_9]) ).
fof(p6_10,axiom,
! [VAR_0,VAR_1] :
( ~ p5(VAR_0,VAR_1)
| p6(f4(VAR_0),VAR_1) ),
file('theBenchmark.p',p6_10) ).
cnf(c_10,plain,
( ~ p5(A,B)
| p6(f4(A),B) ),
inference(clausify,[status(thm)],[p6_10]) ).
fof(p2_11,axiom,
! [VAR_0,VAR_1] :
( ~ p2(VAR_0,VAR_1)
| p2(f3(VAR_0),f3(VAR_1)) ),
file('theBenchmark.p',p2_11) ).
cnf(c_11,plain,
( ~ p2(A,B)
| p2(f3(A),f3(B)) ),
inference(clausify,[status(thm)],[p2_11]) ).
fof(p5_15,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p6(VAR_0,VAR_2)
| ~ p5(VAR_2,VAR_1)
| p5(VAR_0,VAR_1) ),
file('theBenchmark.p',p5_15) ).
cnf(c_15,plain,
( ~ p6(A,C)
| ~ p5(C,B)
| p5(A,B) ),
inference(clausify,[status(thm)],[p5_15]) ).
fof(p5_17,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p2(VAR_3,VAR_0)
| ~ p5(VAR_3,VAR_2)
| ~ p2(VAR_2,VAR_1)
| p5(VAR_0,VAR_1) ),
file('theBenchmark.p',p5_17) ).
cnf(c_17,plain,
( ~ p2(D,A)
| ~ p5(D,C)
| ~ p2(C,B)
| p5(A,B) ),
inference(clausify,[status(thm)],[p5_17]) ).
cnf(c_22,plain,
p6(c7,f3(c7)),
inference(resolve,[status(thm)],[c_9,c_2]) ).
cnf(c_23,plain,
~ p5(c7,f3(f4(c8))),
inference(resolve,[status(thm)],[c_10,c_5]) ).
cnf(c_26,plain,
p2(f3(f4(c7)),f3(f4(c8))),
inference(resolve,[status(thm)],[c_11,c_4]) ).
cnf(c_56,plain,
p6(c7,f3(f3(c7))),
inference(resolve,[status(thm)],[c_9,c_22]) ).
cnf(c_128,plain,
( ~ p6(c7,A)
| ~ p5(A,f3(f4(c8))) ),
inference(resolve,[status(thm)],[c_15,c_23]) ).
cnf(c_124,plain,
~ p5(f3(f3(c7)),f3(f4(c8))),
inference(resolve,[status(thm)],[c_128,c_56]) ).
cnf(c_129,plain,
( ~ p2(B,A)
| ~ p5(B,f3(f4(c7)))
| p5(A,f3(f4(c8))) ),
inference(resolve,[status(thm)],[c_17,c_26]) ).
cnf(c_130,plain,
( ~ p2(f3(f3(c7)),A)
| p5(A,f3(f4(c8))) ),
inference(resolve,[status(thm)],[c_129,c_7]) ).
cnf(c_126,plain,
p5(f3(f3(c7)),f3(f4(c8))),
inference(resolve,[status(thm)],[c_130,c_1]) ).
cnf(c_127,plain,
$false,
inference(resolve,[status(thm)],[c_126,c_124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN563-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n005.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 18:13:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 2779909 was started by sandbox on n005,
% 0.11/0.37 % Sat Sep 26 18:13:47 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.37
% 0.11/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.42
% 0.14/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.42
% 0.14/0.42 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.14/0.42 % Length of proof is 17.
% 0.14/0.42 % Level of proof is 4.
% 0.14/0.42 % Maximum clause weight is 12.000.
% 0.14/0.42 % Given clauses 45.
% 0.14/0.42
% 0.14/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------