%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN108-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 : 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:37:04 AM UTC 2026
% Result : Unsatisfiable 1.18s 0.61s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 7 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 ( 5 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,axiom,
! [VAR_0] : ~ k2(a,VAR_0),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ k2(a,A),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_129,axiom,
! [VAR_0,VAR_1] :
( ~ q1(VAR_1,VAR_0,VAR_0)
| k2(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_129) ).
cnf(c_371,plain,
( ~ q1(B,A,A)
| k2(A,A) ),
inference(clausify,[status(thm)],[rule_129]) ).
fof(rule_107,axiom,
! [VAR_0] :
( ~ m0(e,d,VAR_0)
| ~ m0(VAR_0,d,VAR_0)
| q1(e,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_107) ).
cnf(c_388,plain,
( ~ m0(e,d,A)
| ~ m0(A,d,A)
| q1(e,A,A) ),
inference(clausify,[status(thm)],[rule_107]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_483,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
cnf(c_651,plain,
( ~ m0(e,d,A)
| q1(e,A,A) ),
inference(resolve,[status(thm)],[c_483,c_388]) ).
cnf(c_580,plain,
q1(e,A,A),
inference(resolve,[status(thm)],[c_483,c_651]) ).
cnf(c_649,plain,
~ q1(A,a,a),
inference(resolve,[status(thm)],[c_371,c_264]) ).
cnf(c_650,plain,
$false,
inference(resolve,[status(thm)],[c_649,c_580]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN108-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n011.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 17:11:14 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.43 % Process 1123381 was started by sandbox on n011,
% 0.18/0.43 % Sat Sep 26 17:11:14 2026
% 0.18/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.46
% 0.18/0.46 % From the command line: assign(max_seconds, 300).
% 1.18/0.61
% 1.18/0.61 % SZS status Unsatisfiable for theBenchmark
% 1.18/0.61
% 1.18/0.61 % Proof 1 at 0.14 (+ 0.01) seconds.
% 1.18/0.61 % Length of proof is 7.
% 1.18/0.61 % Level of proof is 2.
% 1.18/0.61 % Maximum clause weight is 17.000.
% 1.18/0.61 % Given clauses 173.
% 1.18/0.61
% 1.18/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------