%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN722+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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 : Fri Sep 25 03:41:28 PM UTC 2026
% Result : Theorem 0.47s 1.30s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 107 ( 51 ~; 43 |; 13 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn 17 !; 4 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm119) ).
fof(f2,negated_conjecture,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
inference(flattening,[],[f2]) ).
fof(f4,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] : q(X0) ),
inference(pure_predicate_removal,[],[f3]) ).
fof(f5,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X1))
| ~ q(X1)
| p(X1) )
& ! [X0] : q(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X1))],[f4]) ).
fof(f6,plain,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X1))
| ~ q(X1)
| p(X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X0] : q(X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : q(X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ q(d)
| ~ q(c)
| ~ q(X0)
| ~ q(sK0(X0)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,negated_conjecture,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ q(d)
| ~ q(c)
| ~ q(sK0(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_49,c_50]) ).
tcf(c_59,plain,
! [X0: $i] :
( p(X0)
| ~ q(d)
| ~ q(c) ),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_49]) ).
tcf(c_68,plain,
! [X0: $i] : p(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_59,c_49,c_49]) ).
tcf(c_73,plain,
~ p(b),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_68]) ).
tcf(c_75,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_73,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN722+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.37 % Computer : n010.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Fri Sep 25 02:11:18 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 0.47/1.30 % SZS status Started for theBenchmark.p
% 0.47/1.30 % SZS status Theorem for theBenchmark.p
% 0.47/1.30
% 0.47/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.47/1.30
% 0.47/1.30 % ------ iProver source info
% 0.47/1.30
% 0.47/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.47/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.47/1.30 % git: non_committed_changes: false
% 0.47/1.30
% 0.47/1.30 % ------ Parsing...
% 0.47/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.47/1.30
% 0.47/1.30 % ------ Preprocessing...%
% 0.47/1.30
% 0.47/1.30 % SZS status Theorem for theBenchmark.p
% 0.47/1.30
% 0.47/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.30
% 0.47/1.30
%------------------------------------------------------------------------------