%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN035-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 : n026.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.15s 10.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 19 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 22 ( 5 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause1,axiom,
! [VAR_0,VAR_1] : p(VAR_0,VAR_1),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
p(A,B),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
! [VAR_0,VAR_1] :
( q(VAR_0,VAR_1)
| ~ p(VAR_1,f(VAR_0,VAR_1))
| ~ p(f(VAR_0,VAR_1),f(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
( q(A,B)
| ~ p(B,f(A,B))
| ~ p(f(A,B),f(A,B)) ),
inference(clausify,[status(thm)],[clause2]) ).
cnf(c_6,plain,
( q(B,A)
| ~ p(A,f(B,A)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_3,plain,
q(A,B),
inference(resolve,[status(thm)],[c_1,c_6]) ).
fof(theorem,axiom,
! [VAR_0,VAR_1] :
( ~ p(VAR_1,f(VAR_0,VAR_1))
| ~ p(f(VAR_0,VAR_1),f(VAR_0,VAR_1))
| ~ q(VAR_0,f(VAR_0,VAR_1))
| ~ q(f(VAR_0,VAR_1),f(VAR_0,VAR_1)) ),
file('theBenchmark.p',theorem) ).
cnf(c_4,plain,
( ~ p(B,f(A,B))
| ~ p(f(A,B),f(A,B))
| ~ q(A,f(A,B))
| ~ q(f(A,B),f(A,B)) ),
inference(clausify,[status(thm)],[theorem]) ).
cnf(c_7,plain,
( ~ p(B,f(A,B))
| ~ p(f(A,B),f(A,B))
| ~ q(A,f(A,B)) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_8,plain,
( ~ p(B,f(A,B))
| ~ p(f(A,B),f(A,B)) ),
inference(resolve,[status(thm)],[c_3,c_7]) ).
cnf(c_9,plain,
~ p(A,f(B,A)),
inference(resolve,[status(thm)],[c_1,c_8]) ).
cnf(c_5,plain,
$false,
inference(resolve,[status(thm)],[c_1,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN035-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.11/10.39 % Computer : n026.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Sat Sep 26 17:07:50 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/10.39 % Process 1521031 was started by sandbox2 on n026,
% 0.11/10.39 % Sat Sep 26 17:07:50 2026
% 0.11/10.39 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/10.40
% 0.15/10.40 % From the command line: assign(max_seconds, 300).
% 0.15/10.40
% 0.15/10.40 % SZS status Unsatisfiable for theBenchmark
% 0.15/10.40
% 0.15/10.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/10.40 % Length of proof is 5.
% 0.15/10.40 % Level of proof is 2.
% 0.15/10.40 % Maximum clause weight is 3.000.
% 0.15/10.40 % Given clauses 0.
% 0.15/10.40
% 0.15/10.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------