%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 3 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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(pel57_3,axiom,
! [X,Y,Z] :
( ( big_f(Y,Z)
& big_f(X,Y) )
=> big_f(X,Z) ),
file('theBenchmark.p',pel57_3) ).
fof(pel57,conjecture,
big_f(f(a,b),f(a,c)),
file('theBenchmark.p',pel57) ).
fof(pel57_neg,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
inference(assume_negation,[status(cth)],[pel57]) ).
fof(pel57_1,axiom,
big_f(f(a,b),f(b,c)),
file('theBenchmark.p',pel57_1) ).
cnf(c_3,plain,
big_f(f(a,b),f(b,c)),
inference(clausify,[status(thm)],[pel57_1]) ).
fof(pel57_2,axiom,
big_f(f(b,c),f(a,c)),
file('theBenchmark.p',pel57_2) ).
cnf(c_4,plain,
big_f(f(b,c),f(a,c)),
inference(clausify,[status(thm)],[pel57_2]) ).
cnf(c_5,plain,
( big_f(A,C)
| ~ big_f(B,C)
| ~ big_f(A,B) ),
inference(clausify,[status(thm)],[pel57_3]) ).
cnf(c_6,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
inference(clausify,[status(thm)],[pel57_neg]) ).
cnf(c_9,plain,
( big_f(f(a,b),A)
| ~ big_f(f(b,c),A) ),
inference(resolve,[status(thm)],[c_5,c_3]) ).
cnf(c_7,plain,
big_f(f(a,b),f(a,c)),
inference(resolve,[status(thm)],[c_9,c_4]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_7,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 17:11:03 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 2095066 was started by sandbox on n020,
% 0.10/0.36 % Sat Sep 26 17:11:03 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 8.
% 0.13/0.38 % Level of proof is 3.
% 0.13/0.38 % Maximum clause weight is 9.000.
% 0.13/0.38 % Given clauses 3.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------