%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN033-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:17 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-2 aty)
% Number of variables : 33 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause1,axiom,
! [VAR_0,VAR_1] : p(g(VAR_0,VAR_1),VAR_0,VAR_1),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
p(g(A,B),A,B),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
! [VAR_0,VAR_1] : p(VAR_0,h(VAR_0,VAR_1),VAR_1),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
p(A,h(A,B),B),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause3,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( p(VAR_5,VAR_4,VAR_2)
| ~ p(VAR_0,VAR_3,VAR_5)
| ~ p(VAR_3,VAR_4,VAR_1)
| ~ p(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',clause3) ).
cnf(c_3,plain,
( p(F,E,C)
| ~ p(A,D,F)
| ~ p(D,E,B)
| ~ p(A,B,C) ),
inference(clausify,[status(thm)],[clause3]) ).
fof(prove_something,axiom,
! [VAR_0] : ~ p(k(VAR_0),VAR_0,k(VAR_0)),
file('theBenchmark.p',prove_something) ).
cnf(c_4,plain,
~ p(k(A),A,k(A)),
inference(clausify,[status(thm)],[prove_something]) ).
cnf(c_10,plain,
( p(E,B,D)
| ~ p(g(C,D),A,E)
| ~ p(A,B,C) ),
inference(resolve,[status(thm)],[c_3,c_1]) ).
cnf(c_11,plain,
( p(D,h(C,A),B)
| ~ p(g(A,B),C,D) ),
inference(resolve,[status(thm)],[c_10,c_2]) ).
cnf(c_8,plain,
p(A,h(B,B),A),
inference(resolve,[status(thm)],[c_11,c_1]) ).
cnf(c_9,plain,
$false,
inference(resolve,[status(thm)],[c_8,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN033-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n005.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.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 17:05:03 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 2611272 was started by sandbox2 on n005,
% 0.09/0.37 % Sat Sep 26 17:05:03 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 6.
% 0.09/0.39 % Level of proof is 2.
% 0.09/0.39 % Maximum clause weight is 16.000.
% 0.09/0.39 % Given clauses 3.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------