%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SYN920+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 : n019.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:38 PM UTC 2025
% Result : Theorem 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 1 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 120 ( 48 ~; 46 |; 12 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,plain,
( ( ( ! [X] :
( ( f(X)
& g(X) )
=> h(X) )
=> ? [X] :
( f(X)
& ~ g(X) ) )
& ( ! [W] :
( f(W)
=> g(W) )
| ! [Z] :
( f(Z)
=> h(Z) ) ) )
=> ( ! [R] :
( ( f(R)
& h(R) )
=> g(R) )
=> ? [V] :
( f(V)
& g(V)
& ~ h(V) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(prove_this_negated,plain,
~ ( ( ( ! [X] :
( ( f(X)
& g(X) )
=> h(X) )
=> ? [X] :
( f(X)
& ~ g(X) ) )
& ( ! [W] :
( f(W)
=> g(W) )
| ! [Z] :
( f(Z)
=> h(Z) ) ) )
=> ( ! [R] :
( ( f(R)
& h(R) )
=> g(R) )
=> ? [V] :
( f(V)
& g(V)
& ~ h(V) ) ) ),
inference(negate_conjecture,[status(cth)],[prove_this]) ).
cnf(0,plain,
( f(sK1)
| sP0 ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l0,plain,
( f(sK1)
| sP0 ),
inference(instantiation,[status(thm)],[0]) ).
cnf(3,plain,
( ~ f(X0)
| ~ f(X1)
| g(X0)
| h(X1) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l1,plain,
( ~ f(sK1)
| ~ f(sK1)
| g(sK1)
| h(sK1) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(7,plain,
( f(sK2)
| ~ sP0 ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l2,plain,
( f(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[7]) ).
cnf(2,plain,
( ~ h(sK1)
| sP0 ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l3,plain,
( ~ h(sK1)
| sP0 ),
inference(instantiation,[status(thm)],[2]) ).
cnf(4,plain,
( ~ f(X0)
| ~ h(X0)
| g(X0) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l5,plain,
( ~ f(sK2)
| ~ h(sK2)
| g(sK2) ),
inference(instantiation,[status(thm)],[4]) ).
cnf(5,plain,
( ~ f(X0)
| ~ g(X0)
| h(X0) ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l9,plain,
( ~ f(sK2)
| ~ g(sK2)
| h(sK2) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l10,plain,
( f(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l14,plain,
( ~ f(sK2)
| ~ f(sK2)
| g(sK2)
| h(sK2) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(6,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(cnf,[status(esa)],[prove_this_negated]) ).
cnf(l16,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l4,plain,
( ~ f(sK1)
| ~ g(sK1)
| h(sK1) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l11,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l8,plain,
( ~ h(sK1)
| sP0 ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l12,plain,
( ~ f(sK2)
| ~ f(sK2)
| g(sK2)
| h(sK2) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l17,plain,
( f(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l18,plain,
( ~ f(sK2)
| ~ h(sK2)
| g(sK2) ),
inference(instantiation,[status(thm)],[4]) ).
cnf(l19,plain,
( ~ f(sK2)
| ~ f(sK2)
| g(sK2)
| h(sK2) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l21,plain,
( ~ f(sK2)
| ~ h(sK2)
| g(sK2) ),
inference(instantiation,[status(thm)],[4]) ).
cnf(l20,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l22,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l23,plain,
( ~ g(sK2)
| ~ sP0 ),
inference(instantiation,[status(thm)],[6]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l5,l9,l10,l14,l16,l4,l11,l8,l12,l17,l18,l19,l21,l20,l22,l23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN920+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jul 22 18:49:19 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % launching worker at depth: 1
% 0.12/0.34 % launching worker at depth: 5
% 0.12/0.34 % launching worker at depth: 4
% 0.12/0.34 % launching worker at depth: 3
% 0.12/0.34 % launching worker at depth: 2
% 0.12/0.34 % launching worker at depth: 6
% 0.12/0.34 % launching worker at depth: 7
% 0.12/0.34 % launching worker at depth: 8
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------