%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN558-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 : n008.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:49 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 18 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 79 ( 43 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 51 ( 1 sgn 18 !; 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(p4_2,axiom,
! [VAR_0] : p4(VAR_0,VAR_0),
file('theBenchmark.p',p4_2) ).
cnf(c_2,plain,
p4(A,A),
inference(clausify,[status(thm)],[p4_2]) ).
fof(p6_3,axiom,
! [VAR_0] : p6(c7,f3(VAR_0)),
file('theBenchmark.p',p6_3) ).
cnf(c_3,plain,
p6(c7,f3(A)),
inference(clausify,[status(thm)],[p6_3]) ).
fof(p5_4,axiom,
p5(c7,c10,c9),
file('theBenchmark.p',p5_4) ).
cnf(c_4,plain,
p5(c7,c10,c9),
inference(clausify,[status(thm)],[p5_4]) ).
fof(p5_5,axiom,
p5(c7,c10,c8),
file('theBenchmark.p',p5_5) ).
cnf(c_5,plain,
p5(c7,c10,c8),
inference(clausify,[status(thm)],[p5_5]) ).
fof(p5_6,axiom,
! [VAR_0] : p5(c7,VAR_0,f3(VAR_0)),
file('theBenchmark.p',p5_6) ).
cnf(c_6,plain,
p5(c7,A,f3(A)),
inference(clausify,[status(thm)],[p5_6]) ).
fof(not_p5_8,axiom,
! [VAR_0] :
( ~ p5(c7,c9,VAR_0)
| ~ p5(c7,c8,VAR_0) ),
file('theBenchmark.p',not_p5_8) ).
cnf(c_8,plain,
( ~ p5(c7,c9,A)
| ~ p5(c7,c8,A) ),
inference(clausify,[status(thm)],[not_p5_8]) ).
fof(p5_11,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p5(VAR_0,VAR_3,VAR_2)
| ~ p5(VAR_0,VAR_1,VAR_3)
| p5(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',p5_11) ).
cnf(c_11,plain,
( ~ p5(A,D,C)
| ~ p5(A,B,D)
| p5(A,B,C) ),
inference(clausify,[status(thm)],[p5_11]) ).
fof(p2_13,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p5(c7,VAR_2,VAR_0)
| ~ p5(c7,VAR_2,VAR_1)
| ~ p6(c7,VAR_0)
| ~ p6(c7,VAR_1)
| p2(VAR_0,VAR_1) ),
file('theBenchmark.p',p2_13) ).
cnf(c_13,plain,
( ~ p5(c7,C,A)
| ~ p5(c7,C,B)
| ~ p6(c7,A)
| ~ p6(c7,B)
| p2(A,B) ),
inference(clausify,[status(thm)],[p2_13]) ).
fof(p5_14,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( ~ p5(VAR_5,VAR_3,VAR_4)
| ~ p4(VAR_5,VAR_0)
| ~ p2(VAR_4,VAR_2)
| ~ p2(VAR_3,VAR_1)
| p5(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',p5_14) ).
cnf(c_14,plain,
( ~ p5(F,D,E)
| ~ p4(F,A)
| ~ p2(E,C)
| ~ p2(D,B)
| p5(A,B,C) ),
inference(clausify,[status(thm)],[p5_14]) ).
cnf(c_15,plain,
~ p5(c7,c9,f3(c8)),
inference(resolve,[status(thm)],[c_8,c_6]) ).
cnf(c_46,plain,
( ~ p5(c7,c8,A)
| p5(c7,c10,A) ),
inference(resolve,[status(thm)],[c_11,c_5]) ).
cnf(c_20,plain,
p5(c7,c10,f3(c8)),
inference(resolve,[status(thm)],[c_46,c_6]) ).
cnf(c_47,plain,
( ~ p5(c7,c9,A)
| p5(c7,c10,A) ),
inference(resolve,[status(thm)],[c_11,c_4]) ).
cnf(c_21,plain,
p5(c7,c10,f3(c9)),
inference(resolve,[status(thm)],[c_47,c_6]) ).
cnf(c_48,plain,
( ~ p5(C,A,B)
| ~ p4(C,c7)
| ~ p2(B,f3(c8))
| ~ p2(A,c9) ),
inference(resolve,[status(thm)],[c_14,c_15]) ).
cnf(c_49,plain,
( ~ p5(B,c9,A)
| ~ p4(B,c7)
| ~ p2(A,f3(c8)) ),
inference(resolve,[status(thm)],[c_48,c_1]) ).
cnf(c_50,plain,
( ~ p5(c7,c9,A)
| ~ p2(A,f3(c8)) ),
inference(resolve,[status(thm)],[c_49,c_2]) ).
cnf(c_27,plain,
~ p2(f3(c9),f3(c8)),
inference(resolve,[status(thm)],[c_50,c_6]) ).
cnf(c_51,plain,
( ~ p5(c7,C,A)
| ~ p5(c7,C,f3(B))
| ~ p6(c7,A)
| p2(A,f3(B)) ),
inference(resolve,[status(thm)],[c_13,c_3]) ).
cnf(c_52,plain,
( ~ p5(c7,C,f3(A))
| ~ p5(c7,C,f3(B))
| p2(f3(A),f3(B)) ),
inference(resolve,[status(thm)],[c_51,c_3]) ).
cnf(c_53,plain,
( ~ p5(c7,c10,f3(A))
| p2(f3(A),f3(c8)) ),
inference(resolve,[status(thm)],[c_52,c_20]) ).
cnf(c_54,plain,
p2(f3(c9),f3(c8)),
inference(resolve,[status(thm)],[c_53,c_21]) ).
cnf(c_45,plain,
$false,
inference(resolve,[status(thm)],[c_27,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN558-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.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 18:14:24 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 59036 was started by sandbox on n008,
% 0.11/0.37 % Sat Sep 26 18:14:24 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.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.11/0.39
% 0.11/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.39
% 0.11/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.39 % Length of proof is 15.
% 0.11/0.39 % Level of proof is 3.
% 0.11/0.39 % Maximum clause weight is 17.000.
% 0.11/0.39 % Given clauses 21.
% 0.11/0.39
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------