%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN006-1 : TPTP v9.3.1. Released v1.0.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 : 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 : Thu Sep 24 09:09:12 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.38s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 14 unt; 4 nHn; 18 RR)
% Number of literals : 30 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( q2(X,f(Y))
| q1(f(X),Y)
| ~ p1(X,f(Y)) ),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
p1(a,Y),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
~ q2(X,f(Y)),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
( q4(X,f(Y))
| q3(f(X),Y)
| ~ p2(X,f(Y)) ),
file('theBenchmark.p',clause_4) ).
cnf(clause_5,negated_conjecture,
~ q3(X,g(Y)),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
~ q4(f(f(X)),f(g(f(Y)))),
file('theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( p2(f(X),Y)
| ~ q1(X,f(Y)) ),
file('theBenchmark.p',clause_7) ).
cnf(t1,plain,
~ q2(a,f(f(f(g(f(U_75)))))),
inference(start,[status(thm),parent(0:0)],[clause_3]) ).
cnf(t2,plain,
( q1(f(a),f(f(g(f(U_75)))))
| ~ p1(a,f(f(f(g(f(U_75))))))
| q2(a,f(f(f(g(f(U_75)))))) ),
inference(extension,[status(thm),parent(t1:1)],[clause_1]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
p1(a,f(f(f(g(f(U_75)))))),
inference(extension,[status(thm),parent(t2:2)],[clause_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( p2(f(f(a)),f(g(f(U_75))))
| ~ q1(f(a),f(f(g(f(U_75))))) ),
inference(extension,[status(thm),parent(t2:3)],[clause_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( q3(f(f(f(a))),g(f(U_75)))
| q4(f(f(a)),f(g(f(U_75))))
| ~ p2(f(f(a)),f(g(f(U_75)))) ),
inference(extension,[status(thm),parent(t6:2)],[clause_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
~ q4(f(f(a)),f(g(f(U_75)))),
inference(extension,[status(thm),parent(t8:2)],[clause_6]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
~ q3(f(f(f(a))),g(f(U_75))),
inference(extension,[status(thm),parent(t8:3)],[clause_5]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN006-1 : TPTP v9.3.1. Released v1.0.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.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 06:23:02 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------