%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN074-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 : n007.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:25 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.49s
% Output : Proof 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 35 ( 20 unt; 5 nHn; 33 RR)
% Number of literals : 59 ( 32 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
( X = a
| ~ big_f(X,Y) ),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,axiom,
( Y = b
| ~ big_f(X,Y) ),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( big_f(X,Y)
| Y != b
| X != a ),
file('theBenchmark.p',clause_3) ).
cnf(clause_8,negated_conjecture,
( f(X) = X
| big_f(f(X),Y)
| Y != g(X) ),
file('theBenchmark.p',clause_8) ).
cnf(clause_10,negated_conjecture,
( h(X,Z) = Z
| big_f(f(X),h(X,Z))
| f(X) != X ),
file('theBenchmark.p',clause_10) ).
cnf(clause_11,negated_conjecture,
( ~ big_f(f(X),h(X,Z))
| h(X,Z) != Z
| f(X) != X ),
file('theBenchmark.p',clause_11) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_5,axiom,
( g(Eq_x_0) = g(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
( h(a,b) != b
| ~ big_f(f(a),h(a,b))
| f(a) != a ),
inference(start,[status(thm),parent(0:0)],[clause_11]) ).
cnf(t2,plain,
( big_f(f(a),g(a))
| g(a) != g(a)
| f(a) = a ),
inference(extension,[status(thm),parent(t1:1)],[clause_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( a != a
| g(a) = g(a) ),
inference(extension,[status(thm),parent(t2:2)],[equality_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
a = a,
inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( f(a) = a
| ~ big_f(f(a),g(a)) ),
inference(extension,[status(thm),parent(t2:3)],[clause_1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
$false,
inference(reduction,[status(thm),parent(t8:2)],[t8:2,t1:1]) ).
cnf(l1,lemma,
f(a) = a,
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t11,plain,
( h(a,b) != b
| f(a) != a
| big_f(f(a),h(a,b)) ),
inference(extension,[status(thm),parent(t1:2)],[clause_3]) ).
cnf(t12,plain,
$false,
inference(connection,[status(thm),parent(t11:1)],[t11:1,t1:2]) ).
cnf(t13,plain,
f(a) = a,
inference(lemma_extension,[status(thm),parent(t11:2)],[l1:1]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t11:2]) ).
cnf(t15,plain,
( big_f(f(a),h(a,b))
| f(a) != a
| h(a,b) = b ),
inference(extension,[status(thm),parent(t11:3)],[clause_10]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t11:3]) ).
cnf(t17,plain,
f(a) = a,
inference(lemma_extension,[status(thm),parent(t15:2)],[l1:1]) ).
cnf(t18,plain,
$false,
inference(connection,[status(thm),parent(t17:1)],[t17:1,t15:2]) ).
cnf(t19,plain,
$false,
inference(reduction,[status(thm),parent(t15:3)],[t15:3,t1:2]) ).
cnf(t20,plain,
( big_f(f(a),h(a,b))
| f(a) != a
| h(a,b) = b ),
inference(extension,[status(thm),parent(t1:3)],[clause_10]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t1:3]) ).
cnf(t22,plain,
f(a) = a,
inference(lemma_extension,[status(thm),parent(t20:2)],[l1:1]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
( h(a,b) = b
| ~ big_f(f(a),h(a,b)) ),
inference(extension,[status(thm),parent(t20:3)],[clause_2]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).
cnf(t26,plain,
$false,
inference(reduction,[status(thm),parent(t24:2)],[t24:2,t1:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN074-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n007.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 20 06:22:19 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.24/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.24/0.49 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------