%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN243-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 : n015.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:23 AM UTC 2026
% Result : Unsatisfiable 0.86s 0.49s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 5 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,axiom,
~ m1(a,d,d),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ m1(a,d,d),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_015,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ m0(VAR_1,VAR_1,VAR_0)
| ~ l0(VAR_2)
| m1(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_015) ).
cnf(c_463,plain,
( ~ m0(B,B,A)
| ~ l0(C)
| m1(A,B,B) ),
inference(clausify,[status(thm)],[rule_015]) ).
fof(axiom_20,axiom,
l0(a),
file('theBenchmark.p',axiom_20) ).
cnf(c_484,plain,
l0(a),
inference(clausify,[status(thm)],[axiom_20]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_485,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
cnf(c_713,plain,
( ~ m0(d,d,a)
| ~ l0(A) ),
inference(resolve,[status(thm)],[c_463,c_264]) ).
cnf(c_711,plain,
~ l0(A),
inference(resolve,[status(thm)],[c_485,c_713]) ).
cnf(c_712,plain,
$false,
inference(resolve,[status(thm)],[c_711,c_484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN243-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 17:28:43 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 380903 was started by sandbox on n015,
% 0.09/0.36 % Sat Sep 26 17:28:43 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.37
% 0.12/0.37 % From the command line: assign(max_seconds, 300).
% 0.86/0.49
% 0.86/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.86/0.49
% 0.86/0.49 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.86/0.49 % Length of proof is 6.
% 0.86/0.49 % Level of proof is 2.
% 0.86/0.49 % Maximum clause weight is 15.000.
% 0.86/0.49 % Given clauses 230.
% 0.86/0.49
% 0.86/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------