%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN005-1.010 : 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 : n011.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:14 AM UTC 2026
% Result : Unsatisfiable 0.03s 0.38s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 22 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 119 ( 65 ~; 54 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 56 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p_1,axiom,
p_1(a,a),
file('theBenchmark.p',p_1) ).
cnf(c_1,plain,
p_1(a,a),
inference(clausify,[status(thm)],[p_1]) ).
fof(disjunction,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6,VAR_7,VAR_8,VAR_9] :
( ~ p_10(VAR_9,VAR_0)
| ~ p_9(VAR_8,VAR_9)
| ~ p_8(VAR_7,VAR_8)
| ~ p_7(VAR_6,VAR_7)
| ~ p_6(VAR_5,VAR_6)
| ~ p_5(VAR_4,VAR_5)
| ~ p_4(VAR_3,VAR_4)
| ~ p_3(VAR_2,VAR_3)
| ~ p_2(VAR_1,VAR_2)
| ~ p_1(VAR_0,VAR_1) ),
file('theBenchmark.p',disjunction) ).
cnf(c_2,plain,
( ~ p_10(V9,A)
| ~ p_9(V8,V9)
| ~ p_8(V7,V8)
| ~ p_7(V6,V7)
| ~ p_6(F,V6)
| ~ p_5(E,F)
| ~ p_4(D,E)
| ~ p_3(C,D)
| ~ p_2(B,C)
| ~ p_1(A,B) ),
inference(clausify,[status(thm)],[disjunction]) ).
fof(p_2,axiom,
p_2(a,a),
file('theBenchmark.p',p_2) ).
cnf(c_3,plain,
p_2(a,a),
inference(clausify,[status(thm)],[p_2]) ).
cnf(c_4,plain,
( ~ p_10(V7,a)
| ~ p_9(V6,V7)
| ~ p_8(F,V6)
| ~ p_7(E,F)
| ~ p_6(D,E)
| ~ p_5(C,D)
| ~ p_4(B,C)
| ~ p_3(A,B)
| ~ p_2(a,A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(p_3,axiom,
p_3(a,a),
file('theBenchmark.p',p_3) ).
cnf(c_5,plain,
p_3(a,a),
inference(clausify,[status(thm)],[p_3]) ).
cnf(c_6,plain,
( ~ p_10(V6,a)
| ~ p_9(F,V6)
| ~ p_8(E,F)
| ~ p_7(D,E)
| ~ p_6(C,D)
| ~ p_5(B,C)
| ~ p_4(A,B)
| ~ p_3(a,A) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
fof(p_4,axiom,
p_4(a,a),
file('theBenchmark.p',p_4) ).
cnf(c_7,plain,
p_4(a,a),
inference(clausify,[status(thm)],[p_4]) ).
cnf(c_8,plain,
( ~ p_10(F,a)
| ~ p_9(E,F)
| ~ p_8(D,E)
| ~ p_7(C,D)
| ~ p_6(B,C)
| ~ p_5(A,B)
| ~ p_4(a,A) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
fof(p_5,axiom,
p_5(a,a),
file('theBenchmark.p',p_5) ).
cnf(c_9,plain,
p_5(a,a),
inference(clausify,[status(thm)],[p_5]) ).
cnf(c_10,plain,
( ~ p_10(E,a)
| ~ p_9(D,E)
| ~ p_8(C,D)
| ~ p_7(B,C)
| ~ p_6(A,B)
| ~ p_5(a,A) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
fof(p_6,axiom,
p_6(a,a),
file('theBenchmark.p',p_6) ).
cnf(c_11,plain,
p_6(a,a),
inference(clausify,[status(thm)],[p_6]) ).
cnf(c_12,plain,
( ~ p_10(D,a)
| ~ p_9(C,D)
| ~ p_8(B,C)
| ~ p_7(A,B)
| ~ p_6(a,A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
fof(p_7,axiom,
p_7(a,a),
file('theBenchmark.p',p_7) ).
cnf(c_13,plain,
p_7(a,a),
inference(clausify,[status(thm)],[p_7]) ).
cnf(c_14,plain,
( ~ p_10(C,a)
| ~ p_9(B,C)
| ~ p_8(A,B)
| ~ p_7(a,A) ),
inference(resolve,[status(thm)],[c_11,c_12]) ).
fof(p_8,axiom,
p_8(a,a),
file('theBenchmark.p',p_8) ).
cnf(c_15,plain,
p_8(a,a),
inference(clausify,[status(thm)],[p_8]) ).
cnf(c_16,plain,
( ~ p_10(B,a)
| ~ p_9(A,B)
| ~ p_8(a,A) ),
inference(resolve,[status(thm)],[c_13,c_14]) ).
fof(p_9,axiom,
p_9(a,a),
file('theBenchmark.p',p_9) ).
cnf(c_17,plain,
p_9(a,a),
inference(clausify,[status(thm)],[p_9]) ).
cnf(c_18,plain,
( ~ p_10(A,a)
| ~ p_9(a,A) ),
inference(resolve,[status(thm)],[c_15,c_16]) ).
fof(p_10,axiom,
p_10(a,a),
file('theBenchmark.p',p_10) ).
cnf(c_19,plain,
p_10(a,a),
inference(clausify,[status(thm)],[p_10]) ).
cnf(c_20,plain,
~ p_10(a,a),
inference(resolve,[status(thm)],[c_17,c_18]) ).
cnf(c_21,plain,
$false,
inference(resolve,[status(thm)],[c_19,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN005-1.010 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 17:03:30 UTC 2026
% 0.03/0.37 % CPUTime :
% 0.03/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.37 % Process 1108236 was started by sandbox on n011,
% 0.03/0.37 % Sat Sep 26 17:03:30 2026
% 0.03/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.03/0.37
% 0.03/0.37 % From the command line: assign(max_seconds, 300).
% 0.03/0.38
% 0.03/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.03/0.38
% 0.03/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.03/0.38 % Length of proof is 21.
% 0.03/0.38 % Level of proof is 10.
% 0.03/0.38 % Maximum clause weight is 0.000.
% 0.03/0.38 % Given clauses 0.
% 0.03/0.38
% 0.03/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------