%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 : Thu Sep 24 09:09:26 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 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 : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
big_f(f(a,b),f(b,c)),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,axiom,
big_f(f(b,c),f(a,c)),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( big_f(X,Z)
| ~ big_f(Y,Z)
| ~ big_f(X,Y) ),
file('theBenchmark.p',clause_3) ).
cnf(prove_this,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ big_f(f(a,b),f(a,c)),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ big_f(f(b,c),f(a,c))
| ~ big_f(f(a,b),f(b,c))
| big_f(f(a,b),f(a,c)) ),
inference(extension,[status(thm),parent(t1:1)],[clause_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
big_f(f(a,b),f(b,c)),
inference(extension,[status(thm),parent(t2:2)],[clause_1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
big_f(f(b,c),f(a,c)),
inference(extension,[status(thm),parent(t2:3)],[clause_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n017.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 : Sun Sep 20 06:19:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------