%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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:58 PM UTC 2026
% Result : Theorem 1.16s 16.31s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 1 unt; 2 def)
% Number of atoms : 191 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 239 ( 90 ~; 106 |; 32 &)
% ( 4 <=>; 4 =>; 0 <=; 3 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 7 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel17) ).
fof(f2,negated_conjecture,
~ ( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ( q
& ~ r )
| ~ p
| s )
<~> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ( q
& ~ r )
| ~ p
| s )
<~> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(flattening,[],[f3]) ).
fof(f8,plain,
( ( ~ sP1
| ( q
& ~ r )
| ~ p
| s )
& ( ( ( ~ q
| r )
& p
& ~ s )
| sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f9,plain,
( ( ~ sP1
| ( q
& ~ r )
| ~ p
| s )
& ( ( ( ~ q
| r )
& p
& ~ s )
| sP1 ) ),
inference(flattening,[],[f8]) ).
fof(f12,plain,
( ( sP1
| ( sP0
& ( s
| q
| ~ p ) ) )
& ( ~ sP1
| ~ sP0
| ( ~ s
& ~ q
& p ) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f13,plain,
( ( sP1
| ( sP0
& ( s
| q
| ~ p ) ) )
& ( ~ sP1
| ~ sP0
| ( ~ s
& ~ q
& p ) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
( ~ sP1
| q
| ~ p
| s ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
( ~ sP1
| ~ r
| ~ p
| s ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
( ~ q
| r
| sP1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
( p
| sP1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
( ~ s
| sP1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
( sP1
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
( sP1
| s
| q
| ~ p ),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
( ~ sP1
| ~ sP0
| ~ s ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
( ~ sP1
| ~ sP0
| ~ q ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
( ~ sP1
| ~ sP0
| p ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_49,plain,
( sP1
| ~ s ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_50,plain,
( p
| sP1 ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_51,plain,
( r
| sP1
| ~ q ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_52,plain,
( s
| ~ r
| ~ p
| ~ sP1 ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_53,plain,
( q
| s
| ~ p
| ~ sP1 ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_58,negated_conjecture,
( p
| ~ sP0
| ~ sP1 ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_59,negated_conjecture,
( ~ sP0
| ~ q
| ~ sP1 ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_60,negated_conjecture,
( ~ sP0
| ~ s
| ~ sP1 ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_61,negated_conjecture,
( q
| s
| sP1
| ~ p ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_62,negated_conjecture,
( sP0
| sP1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f5,definition,
( sP0
<=> ( s
| ~ r
| ~ p ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f6,definition,
( sP1
<=> ( ( q
& ~ r )
| ~ p
| s ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f7,plain,
( sP1
<~> ( sP0
& ( s
| q
| ~ p ) ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f10,plain,
( ( ~ sP0
| s
| ~ r
| ~ p )
& ( ( ~ s
& r
& p )
| sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f11,plain,
( ( ~ sP0
| s
| ~ r
| ~ p )
& ( ( ~ s
& r
& p )
| sP0 ) ),
inference(flattening,[],[f10]) ).
fof(f19,plain,
( ~ sP0
| s
| ~ r
| ~ p ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
( ~ s
| sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f21,plain,
( r
| sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
( p
| sP0 ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_54,plain,
( sP0
| p ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,plain,
( sP0
| r ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,plain,
( sP0
| ~ s ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_57,plain,
( s
| ~ sP0
| ~ r
| ~ p ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_63,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_52,c_57,c_53,c_59,c_60,c_58,c_61,c_51,c_49,c_56,c_50,c_54,c_55,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/15.40 % Computer : n004.cluster.edu
% 0.03/15.40 % Model : x86_64 x86_64
% 0.03/15.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/15.40 % Memory : 8046.5625MB
% 0.03/15.40 % OS : Linux 6.8.0-71-generic
% 0.03/15.40 % CPULimit : 300
% 0.03/15.40 % WCLimit : 300
% 0.03/15.40 % DateTime : Thu Sep 24 23:56:23 UTC 2026
% 0.03/15.40 % CPUTime :
% 0.03/15.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/15.44 Running first-order theorem proving
% 0.03/15.44 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.03/15.45
% 0.03/15.45 % ======== iProver multi-core TPTP/SMT =========
% 0.03/15.45
% 0.03/15.45 % Detected problem language: tptp
% 0.03/15.46 % Proving...
% 1.16/16.31 % SZS status Started for theBenchmark.p
% 1.16/16.31 % SZS status Theorem for theBenchmark.p
% 1.16/16.31
% 1.16/16.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/16.31
% 1.16/16.31 % ------ iProver source info
% 1.16/16.31
% 1.16/16.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/16.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/16.31 % git: non_committed_changes: false
% 1.16/16.31
% 1.16/16.31 % ------ Parsing...
% 1.16/16.31 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.16/16.31 %
% 1.16/16.31
% 1.16/16.31 % ------ Preprocessing...%
% 1.16/16.31
% 1.16/16.31 % SZS status Theorem for theBenchmark.p
% 1.16/16.31
% 1.16/16.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/16.31
% 1.16/16.31
%------------------------------------------------------------------------------