%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:59 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% 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 : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_1,axiom,
big_f(f(a,b),f(b,c)),
file('theBenchmark.p',clause_1) ).
cnf(c_1,plain,
big_f(f(a,b),f(b,c)),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_2,axiom,
big_f(f(b,c),f(a,c)),
file('theBenchmark.p',clause_2) ).
cnf(c_2,plain,
big_f(f(b,c),f(a,c)),
inference(clausify,[status(thm)],[clause_2]) ).
fof(clause_3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( big_f(VAR_0,VAR_2)
| ~ big_f(VAR_1,VAR_2)
| ~ big_f(VAR_0,VAR_1) ),
file('theBenchmark.p',clause_3) ).
cnf(c_3,plain,
( big_f(A,C)
| ~ big_f(B,C)
| ~ big_f(A,B) ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(prove_this,axiom,
~ big_f(f(a,b),f(a,c)),
file('theBenchmark.p',prove_this) ).
cnf(c_4,plain,
~ big_f(f(a,b),f(a,c)),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_7,plain,
( big_f(f(a,b),A)
| ~ big_f(f(b,c),A) ),
inference(resolve,[status(thm)],[c_3,c_1]) ).
cnf(c_5,plain,
big_f(f(a,b),f(a,c)),
inference(resolve,[status(thm)],[c_7,c_2]) ).
cnf(c_6,plain,
$false,
inference(resolve,[status(thm)],[c_5,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n003.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 17:11:54 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 3381969 was started by sandbox on n003,
% 0.17/0.43 % Sat Sep 26 17:11:54 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 0.17/0.45
% 0.17/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.45
% 0.17/0.45 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.45 % Length of proof is 6.
% 0.17/0.45 % Level of proof is 2.
% 0.17/0.45 % Maximum clause weight is 9.000.
% 0.17/0.45 % Given clauses 3.
% 0.17/0.45
% 0.17/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------