%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN054+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 : n026.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:00 PM UTC 2026
% Result : Theorem 1.16s 1.31s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 62 ( 29 ~; 26 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 18 !; 9 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
~ ? [X0] :
( big_q(X0)
& big_s(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel24_1) ).
fof(f2,axiom,
! [X0] :
( big_p(X0)
=> ( big_r(X0)
| big_q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel24_2) ).
fof(f3,axiom,
( ~ ? [X0] : big_p(X0)
=> ? [X1] : big_q(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel24_3) ).
fof(f4,axiom,
! [X0] :
( ( big_r(X0)
| big_q(X0) )
=> big_s(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel24_4) ).
fof(f5,conjecture,
? [X0] :
( big_r(X0)
& big_p(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel24) ).
fof(f6,negated_conjecture,
~ ? [X0] :
( big_r(X0)
& big_p(X0) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0] :
( ~ big_q(X0)
| ~ big_s(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0] :
( ~ big_p(X0)
| big_r(X0)
| big_q(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0] :
( ~ big_p(X0)
| big_r(X0)
| big_q(X0) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
( ? [X0] : big_p(X0)
| ? [X1] : big_q(X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0] :
( ( ~ big_r(X0)
& ~ big_q(X0) )
| big_s(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0] :
( ~ big_r(X0)
| ~ big_p(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f13,plain,
( ? [X1] : big_p(X1)
| ? [X0] : big_q(X0) ),
inference(rectify,[],[f10]) ).
fof(f14,plain,
( big_p(sK1)
| big_q(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f13]) ).
fof(f15,plain,
! [X0] :
( ~ big_q(X0)
| ~ big_s(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
! [X0] :
( ~ big_p(X0)
| big_r(X0)
| big_q(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
( big_p(sK1)
| big_q(sK0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X0] :
( ~ big_q(X0)
| big_s(X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0] :
( ~ big_r(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_49,plain,
! [X0: $i] :
( ~ big_q(X0)
| ~ big_s(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_50,plain,
! [X0: $i] :
( big_r(X0)
| big_q(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_51,plain,
( big_p(sK1)
| big_q(sK0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
! [X0: $i] :
( big_s(X0)
| ~ big_q(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( ~ big_p(X0)
| ~ big_r(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_56,plain,
( big_s(sK0)
| ~ big_q(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_58,plain,
( ~ big_q(sK0)
| ~ big_s(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_60,plain,
big_p(sK1),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_56,c_58]) ).
tcf(c_62,plain,
! [X0: $i] : ~ big_q(X0),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_49]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] : ~ big_p(X0),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_50,c_62]) ).
tcf(c_70,plain,
! [X0: $i] : ~ big_p(X0),
inference(global_subsumption_just,[status(thm)],[c_50,c_65]) ).
tcf(c_73,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_60,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN054+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.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Fri Sep 25 00:00:24 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.45
% 0.14/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.45
% 0.14/0.45 % Detected problem language: tptp
% 0.20/0.47 % Proving...
% 1.16/1.31 % SZS status Started for theBenchmark.p
% 1.16/1.31 % SZS status Theorem for theBenchmark.p
% 1.16/1.31
% 1.16/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/1.31
% 1.16/1.31 % ------ iProver source info
% 1.16/1.31
% 1.16/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/1.31 % git: non_committed_changes: false
% 1.16/1.31
% 1.16/1.31 % ------ Parsing...
% 1.16/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.16/1.31 %
% 1.16/1.31
% 1.16/1.31 % ------ Preprocessing...%
% 1.16/1.31
% 1.16/1.31 % SZS status Theorem for theBenchmark.p
% 1.16/1.31
% 1.16/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.31
% 1.16/1.31
%------------------------------------------------------------------------------