%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN728-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /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 : Thu Sep 24 09:10:58 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 14 unt; 6 nHn; 25 RR)
% Number of literals : 46 ( 0 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(thm69_1,negated_conjecture,
( ~ p(A,B)
| p(C,C) ),
file('theBenchmark.p',thm69_1) ).
cnf(thm69_2,negated_conjecture,
( p(A,sk1(A))
| m(A) ),
file('theBenchmark.p',thm69_2) ).
cnf(thm69_3,negated_conjecture,
( p(A,sk1(A))
| q(f(A,sk1(A))) ),
file('theBenchmark.p',thm69_3) ).
cnf(thm69_4,negated_conjecture,
( ~ q(A)
| ~ m(g(A)) ),
file('theBenchmark.p',thm69_4) ).
cnf(thm69_5,negated_conjecture,
( ~ p(g(sk2),A)
| ~ p(sk2,sk2) ),
file('theBenchmark.p',thm69_5) ).
cnf(t1,plain,
( ~ p(g(sk2),sk1(g(sk2)))
| ~ p(sk2,sk2) ),
inference(start,[status(thm),parent(0:0)],[thm69_5]) ).
cnf(t2,plain,
( ~ p(U_42,sk1(U_42))
| p(sk2,sk2) ),
inference(extension,[status(thm),parent(t1:1)],[thm69_1]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( q(f(U_42,sk1(U_42)))
| p(U_42,sk1(U_42)) ),
inference(extension,[status(thm),parent(t2:2)],[thm69_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ m(g(f(U_42,sk1(U_42))))
| ~ q(f(U_42,sk1(U_42))) ),
inference(extension,[status(thm),parent(t4:2)],[thm69_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( p(g(f(U_42,sk1(U_42))),sk1(g(f(U_42,sk1(U_42)))))
| m(g(f(U_42,sk1(U_42)))) ),
inference(extension,[status(thm),parent(t6:2)],[thm69_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( p(sk2,sk2)
| ~ p(g(f(U_42,sk1(U_42))),sk1(g(f(U_42,sk1(U_42))))) ),
inference(extension,[status(thm),parent(t8:2)],[thm69_1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
$false,
inference(reduction,[status(thm),parent(t10:2)],[t10:2,t1:1]) ).
cnf(l1,lemma,
p(sk2,sk2),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t13,plain,
( q(f(g(sk2),sk1(g(sk2))))
| p(g(sk2),sk1(g(sk2))) ),
inference(extension,[status(thm),parent(t1:2)],[thm69_3]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t1:2]) ).
cnf(t15,plain,
( ~ m(g(f(g(sk2),sk1(g(sk2)))))
| ~ q(f(g(sk2),sk1(g(sk2)))) ),
inference(extension,[status(thm),parent(t13:2)],[thm69_4]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t13:2]) ).
cnf(t17,plain,
( p(g(f(g(sk2),sk1(g(sk2)))),sk1(g(f(g(sk2),sk1(g(sk2))))))
| m(g(f(g(sk2),sk1(g(sk2))))) ),
inference(extension,[status(thm),parent(t15:2)],[thm69_2]) ).
cnf(t18,plain,
$false,
inference(connection,[status(thm),parent(t17:1)],[t17:1,t15:2]) ).
cnf(t19,plain,
( p(g(sk2),g(sk2))
| ~ p(g(f(g(sk2),sk1(g(sk2)))),sk1(g(f(g(sk2),sk1(g(sk2)))))) ),
inference(extension,[status(thm),parent(t17:2)],[thm69_1]) ).
cnf(t20,plain,
$false,
inference(connection,[status(thm),parent(t19:1)],[t19:1,t17:2]) ).
cnf(t21,plain,
( ~ p(sk2,sk2)
| ~ p(g(sk2),g(sk2)) ),
inference(extension,[status(thm),parent(t19:2)],[thm69_5]) ).
cnf(t22,plain,
$false,
inference(connection,[status(thm),parent(t21:1)],[t21:1,t19:2]) ).
cnf(t23,plain,
p(sk2,sk2),
inference(lemma_extension,[status(thm),parent(t21:2)],[l1:1]) ).
cnf(t24,plain,
$false,
inference(connection,[status(thm),parent(t23:1)],[t23:1,t21:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN728-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n003.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 07:09:15 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
%------------------------------------------------------------------------------