%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SYN980+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Jul 25 09:28:45 PM UTC 2025
% Result : Theorem 0.13s 0.34s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_this_negated)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,plain,
! [B] :
( ! [Y] :
( ( r(B)
=> r(Y) )
=> p(f(Y),Y) )
=> ? [X,Y] :
( p(X,Y)
& ( q(f(B),B)
=> q(X,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
% launching worker at depth: 9fof(prove_this_negated, plain, ~(![B]:(![Y]:((r(B)=>r(Y))=>p(f(Y),Y))=>?[X,Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))), inference(negate_conjecture, [status(cth)], [prove_this])).
cnf(0,plain,
( p(f(X0),X0)
| r(sK1) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l0,plain,
( p(f(sK1),sK1)
| r(sK1) ),
inference(instantiation,[status(thm)],[0]) ).
cnf(3,plain,
( ~ p(X0,X1)
| ~ q(X0,X1) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l1,plain,
( ~ p(f(sK1),sK1)
| ~ q(f(sK1),sK1) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(1,plain,
( ~ r(X0)
| p(f(X0),X0) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l2,plain,
( ~ r(sK1)
| p(f(sK1),sK1) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l3,plain,
( ~ p(f(sK1),sK1)
| ~ q(f(sK1),sK1) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(2,plain,
( ~ p(X0,X1)
| q(f(sK1),sK1) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l4,plain,
( ~ p(f(sK1),sK1)
| q(f(sK1),sK1) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l5,plain,
( ~ p(f(sK1),sK1)
| q(f(sK1),sK1) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN980+1 : TPTP v9.0.0. Released v3.1.0.
% 0.03/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Jul 22 18:53:04 EDT 2025
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % launching worker at depth: 6
% 0.13/0.34 % launching worker at depth: 1
% 0.13/0.34 % launching worker at depth: 5
% 0.13/0.34 % launching worker at depth: 3
% 0.13/0.34 % launching worker at depth: 4
% 0.13/0.34 % launching worker at depth: 2
% 0.13/0.34 % launching worker at depth: 7
% 0.13/0.34 % launching worker at depth: 8
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------