%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN311-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:37:31 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 22 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 24 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p(VAR_1,VAR_2,VAR_3,VAR_0)
| p(VAR_0,VAR_1,VAR_2,VAR_3) ),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
( ~ p(B,C,D,A)
| p(A,B,C,D) ),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p(VAR_3,VAR_2,VAR_1,VAR_0)
| p(VAR_0,VAR_1,VAR_2,VAR_3) ),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
( ~ p(D,C,B,A)
| p(A,B,C,D) ),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause3,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p(VAR_0,VAR_1,VAR_2,VAR_3)
| p(VAR_0,VAR_1,VAR_2,g(VAR_3)) ),
file('theBenchmark.p',clause3) ).
cnf(c_3,plain,
( ~ p(A,B,C,D)
| p(A,B,C,g(D)) ),
inference(clausify,[status(thm)],[clause3]) ).
fof(clause4,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p(VAR_0,VAR_1,VAR_2,VAR_3)
| p(f(VAR_0),VAR_1,VAR_2,VAR_3) ),
file('theBenchmark.p',clause4) ).
cnf(c_4,plain,
( ~ p(A,B,C,D)
| p(f(A),B,C,D) ),
inference(clausify,[status(thm)],[clause4]) ).
fof(clause5,axiom,
p(a,b,c,d),
file('theBenchmark.p',clause5) ).
cnf(c_5,plain,
p(a,b,c,d),
inference(clausify,[status(thm)],[clause5]) ).
fof(clause6,axiom,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
file('theBenchmark.p',clause6) ).
cnf(c_6,plain,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
inference(clausify,[status(thm)],[clause6]) ).
cnf(c_10,plain,
p(d,a,b,c),
inference(resolve,[status(thm)],[c_1,c_5]) ).
cnf(c_11,plain,
~ p(g(d),f(g(c)),f(g(b)),f(g(a))),
inference(resolve,[status(thm)],[c_6,c_4]) ).
cnf(c_18,plain,
~ p(f(g(a)),f(g(b)),f(g(c)),g(d)),
inference(resolve,[status(thm)],[c_11,c_2]) ).
cnf(c_20,plain,
~ p(g(a),f(g(b)),f(g(c)),g(d)),
inference(resolve,[status(thm)],[c_18,c_4]) ).
cnf(c_23,plain,
~ p(g(a),f(g(b)),f(g(c)),d),
inference(resolve,[status(thm)],[c_20,c_3]) ).
cnf(c_26,plain,
~ p(d,f(g(c)),f(g(b)),g(a)),
inference(resolve,[status(thm)],[c_23,c_2]) ).
cnf(c_34,plain,
p(c,d,a,b),
inference(resolve,[status(thm)],[c_1,c_10]) ).
cnf(c_44,plain,
~ p(d,f(g(c)),f(g(b)),a),
inference(resolve,[status(thm)],[c_26,c_3]) ).
cnf(c_47,plain,
~ p(f(g(c)),f(g(b)),a,d),
inference(resolve,[status(thm)],[c_44,c_1]) ).
cnf(c_49,plain,
~ p(g(c),f(g(b)),a,d),
inference(resolve,[status(thm)],[c_47,c_4]) ).
cnf(c_53,plain,
p(c,d,a,g(b)),
inference(resolve,[status(thm)],[c_3,c_34]) ).
cnf(c_62,plain,
~ p(d,a,f(g(b)),g(c)),
inference(resolve,[status(thm)],[c_49,c_2]) ).
cnf(c_64,plain,
~ p(d,a,f(g(b)),c),
inference(resolve,[status(thm)],[c_62,c_3]) ).
cnf(c_66,plain,
~ p(c,f(g(b)),a,d),
inference(resolve,[status(thm)],[c_64,c_2]) ).
cnf(c_68,plain,
~ p(f(g(b)),a,d,c),
inference(resolve,[status(thm)],[c_66,c_1]) ).
cnf(c_89,plain,
~ p(g(b),a,d,c),
inference(resolve,[status(thm)],[c_68,c_4]) ).
cnf(c_92,plain,
~ p(c,d,a,g(b)),
inference(resolve,[status(thm)],[c_89,c_2]) ).
cnf(c_93,plain,
$false,
inference(resolve,[status(thm)],[c_92,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN311-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 17:34:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 994255 was started by sandbox2 on n018,
% 0.08/0.36 % Sat Sep 26 17:34:22 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.36
% 0.14/0.36 % From the command line: assign(max_seconds, 300).
% 0.14/0.37
% 0.14/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.37
% 0.14/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.37 % Length of proof is 24.
% 0.14/0.37 % Level of proof is 15.
% 0.14/0.37 % Maximum clause weight is 13.000.
% 0.14/0.37 % Given clauses 37.
% 0.14/0.37
% 0.14/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------