%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN066+1 : TPTP v9.3.1. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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:39:04 PM UTC 2026
% Result : Theorem 1.13s 1.28s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 49 ( 22 ~; 17 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 49 !; 13 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( big_p(X3,X1)
=> ? [X4] : big_q(X4,X1) )
& big_p(X3,X0)
& ( big_p(X2,X0)
=> big_p(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_1) ).
fof(f2,axiom,
! [X0,X1] :
( ~ big_p(X0,X1)
=> ? [X2] : big_q(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_2) ).
fof(f3,axiom,
( ? [X0,X1] : big_q(X0,X1)
=> ! [X2] : big_r(X2,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_3) ).
fof(f4,conjecture,
! [X0] :
? [X1] : big_r(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37) ).
fof(f5,negated_conjecture,
~ ! [X0] :
? [X1] : big_r(X0,X1),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_p(X3,X1)
| ? [X4] : big_q(X4,X1) )
& big_p(X3,X0)
& ( ~ big_p(X2,X0)
| big_p(X3,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1] :
( big_p(X0,X1)
| ? [X2] : big_q(X2,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
( ! [X0,X1] : ~ big_q(X0,X1)
| ! [X2] : big_r(X2,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
? [X0] :
! [X1] : ~ big_r(X0,X1),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
! [X0,X2] :
( ( ~ big_p(sK1(X0,X2),sK0(X0))
| big_q(sK2(X0),sK0(X0)) )
& big_p(sK1(X0,X2),X0)
& ( ~ big_p(X2,X0)
| big_p(sK1(X0,X2),sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X1,sK0(X0)),skolemize(X3,sK1(X0,X2)),skolemize(X4,sK2(X0))],[f6]) ).
fof(f11,plain,
! [X0,X1] :
( big_p(X0,X1)
| big_q(sK3(X1),X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X1))],[f7]) ).
fof(f12,plain,
( ! [X1,X2] : ~ big_q(X1,X2)
| ! [X0] : big_r(X0,X0) ),
inference(rectify,[],[f8]) ).
fof(f13,plain,
! [X1] : ~ big_r(sK4,X1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X0,sK4)],[f9]) ).
fof(f14,plain,
! [X2,X0] :
( ~ big_p(sK1(X0,X2),sK0(X0))
| big_q(sK2(X0),sK0(X0)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
! [X2,X0] :
( ~ big_p(X2,X0)
| big_p(sK1(X0,X2),sK0(X0)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X0,X1] :
( big_p(X0,X1)
| big_q(sK3(X1),X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ big_q(X1,X2)
| big_r(X0,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X1] : ~ big_r(sK4,X1),
inference(cnf_transformation,[],[f13]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( big_p(sK1(X1,X0),sK0(X1))
| ~ big_p(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( big_q(sK2(X0),sK0(X0))
| ~ big_p(sK1(X0,X1),sK0(X0)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( big_p(X1,X0)
| big_q(sK3(X0),X0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( big_r(X2,X2)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] : ~ big_r(sK4,X0),
inference(cnf_transformation,[],[f19]) ).
tcf(c_59,plain,
( big_p(sK1(sK4,sK4),sK0(sK4))
| ~ big_p(sK4,sK4) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] : ~ big_q(X0,X1),
inference(resolution,[status(thm)],[c_53,c_54]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] : big_p(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_81]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] : ~ big_p(sK1(X0,X1),sK0(X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_81]) ).
tcf(c_89,plain,
~ big_p(sK1(sK4,sK4),sK0(sK4)),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_90,plain,
big_p(sK4,sK4),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_91,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_90,c_89,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN066+1 : TPTP v9.3.1. Bugfixed v3.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 00:07:40 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.43 % Detected problem language: tptp
% 0.14/0.44 % Proving...
% 1.13/1.28 % SZS status Started for theBenchmark.p
% 1.13/1.28 % SZS status Theorem for theBenchmark.p
% 1.13/1.28
% 1.13/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.13/1.28
% 1.13/1.28 % ------ iProver source info
% 1.13/1.28
% 1.13/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.13/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.13/1.28 % git: non_committed_changes: false
% 1.13/1.28
% 1.13/1.28 % ------ Parsing...
% 1.13/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.13/1.28
% 1.13/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s%
% 1.13/1.28
% 1.13/1.28 % SZS status Theorem for theBenchmark.p
% 1.13/1.28
% 1.13/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.28
% 1.13/1.28
%------------------------------------------------------------------------------