%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN050+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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:38:59 PM UTC 2026
% Result : Theorem 0.48s 1.29s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 65 ( 22 ~; 14 |; 20 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 64 ( 3 sgn 49 !; 15 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_q(X1)
& big_p(X0) )
=> ( big_s(X3)
& big_r(X2) ) )
=> ? [X4,X5] :
( ( big_q(X5)
& big_p(X4) )
=> ? [X6] : big_r(X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel20) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_q(X1)
& big_p(X0) )
=> ( big_s(X3)
& big_r(X2) ) )
=> ? [X4,X5] :
( ( big_q(X5)
& big_p(X4) )
=> ? [X6] : big_r(X6) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_q(X1)
& big_p(X0) )
=> big_r(X2) )
=> ? [X4,X5] :
( ( big_q(X5)
& big_p(X4) )
=> ? [X6] : big_r(X6) ) ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f4,plain,
( ! [X0,X1] :
? [X2] :
! [X3] :
( ~ big_q(X1)
| ~ big_p(X0)
| big_r(X2) )
& ! [X4,X5] :
( big_q(X5)
& big_p(X4)
& ! [X6] : ~ big_r(X6) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X0,X1] :
? [X2] :
! [X3] :
( ~ big_q(X1)
| ~ big_p(X0)
| big_r(X2) )
& ! [X4,X5] :
( big_q(X5)
& big_p(X4)
& ! [X6] : ~ big_r(X6) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X3,X4] :
? [X5] :
( ~ big_q(X4)
| ~ big_p(X3)
| big_r(X5) )
& ! [X0,X1] :
( big_q(X1)
& big_p(X0)
& ! [X2] : ~ big_r(X2) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X3,X4] :
( ~ big_q(X4)
| ~ big_p(X3)
| big_r(sK0(X3,X4)) )
& ! [X0,X1] :
( big_q(X1)
& big_p(X0)
& ! [X2] : ~ big_r(X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X3,X4))],[f6]) ).
fof(f8,plain,
! [X3,X4] :
( ~ big_q(X4)
| ~ big_p(X3)
| big_r(sK0(X3,X4)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X1] : big_q(X1),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0] : big_p(X0),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2] : ~ big_r(X2),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : ~ big_r(X0),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] : big_p(X0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] : big_q(X0),
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( big_r(sK0(X0,X1))
| ~ big_q(X1)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( big_r(sK0(X0,X1))
| ~ big_q(X1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_52]) ).
tcf(c_58,negated_conjecture,
! [X0: $i,X1: $i] :
( big_r(sK0(X1,X0))
| ~ big_q(X0) ),
inference(renaming,[status(thm)],[c_57]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : big_r(sK0(X1,X0)),
inference(global_subsumption_just,[status(thm)],[c_58,c_51,c_58]) ).
tcf(c_61,negated_conjecture,
! [X0: $i,X1: $i] : big_r(sK0(X0,X1)),
inference(renaming,[status(thm)],[c_60]) ).
tcf(c_69,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_61,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN050+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 00:01:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 0.48/1.29 % SZS status Started for theBenchmark.p
% 0.48/1.29 % SZS status Theorem for theBenchmark.p
% 0.48/1.29
% 0.48/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.48/1.29
% 0.48/1.29 % ------ iProver source info
% 0.48/1.29
% 0.48/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.48/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.48/1.29 % git: non_committed_changes: false
% 0.48/1.29
% 0.48/1.29 % ------ Parsing...
% 0.48/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.48/1.29
% 0.48/1.29 % ------ Preprocessing...%
% 0.48/1.29
% 0.48/1.29 % SZS status Theorem for theBenchmark.p
% 0.48/1.29
% 0.48/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.29
% 0.48/1.29
%------------------------------------------------------------------------------