%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN169-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:12 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.54s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 7 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_34,axiom,
n0(c,d),
file('theBenchmark.p',axiom_34) ).
cnf(c_3,plain,
n0(c,d),
inference(clausify,[status(thm)],[axiom_34]) ).
fof(rule_066,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| p1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_066) ).
cnf(c_17,plain,
( ~ n0(B,A)
| p1(A,A,A) ),
inference(clausify,[status(thm)],[rule_066]) ).
fof(rule_137,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p1(VAR_1,VAR_2,VAR_0)
| n2(VAR_0) ),
file('theBenchmark.p',rule_137) ).
cnf(c_46,plain,
( ~ p1(B,C,A)
| n2(A) ),
inference(clausify,[status(thm)],[rule_137]) ).
fof(rule_244,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| p3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_244) ).
cnf(c_56,plain,
( ~ n2(A)
| p3(A,A,A) ),
inference(clausify,[status(thm)],[rule_244]) ).
cnf(c_170,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_237,plain,
p1(d,d,d),
inference(resolve,[status(thm)],[c_17,c_3]) ).
fof(prove_this,axiom,
! [VAR_0,VAR_1] : ~ p3(VAR_0,d,VAR_1),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ p3(A,d,B),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_639,plain,
p3(d,d,d),
inference(resolve,[status(thm)],[c_170,c_237]) ).
cnf(c_638,plain,
$false,
inference(resolve,[status(thm)],[c_264,c_639]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN169-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:15:54 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 54259 was started by sandbox on n007,
% 0.09/0.37 % Sat Sep 26 17:15:54 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.39
% 0.13/0.39 % From the command line: assign(max_seconds, 300).
% 0.13/0.54
% 0.13/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.54
% 0.13/0.54 % Proof 1 at 0.13 (+ 0.01) seconds.
% 0.13/0.54 % Length of proof is 8.
% 0.13/0.54 % Level of proof is 2.
% 0.13/0.54 % Maximum clause weight is 13.000.
% 0.13/0.54 % Given clauses 60.
% 0.13/0.54
% 0.13/0.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------