%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN393+1.003 : 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:57 PM UTC 2026
% Result : Theorem 0.43s 1.30s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 40 ( 1 unt; 1 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 246 ( 87 ~; 124 |; 14 &)
% ( 19 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 5 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 : 5 ( 4 usr; 5 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,
( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel12) ).
fof(f2,negated_conjecture,
~ ( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ( p1
<=> p2 )
<=> p3 )
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
( ( sP0
| ( ( ~ p1
| ( ( ~ p2
| p3 )
& ( ~ p3
| p2 ) ) )
& ( ( ( p2
| p3 )
& ( ~ p2
| ~ p3 ) )
| p1 ) ) )
& ( ~ sP0
| ( ( p1
| ( ( ~ p2
| p3 )
& ( ~ p3
| p2 ) ) )
& ( ~ p1
| ( ( p2
| p3 )
& ( ~ p2
| ~ p3 ) ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f16,plain,
( sP0
| ~ p1
| ~ p2
| p3 ),
inference(cnf_transformation,[],[f7]) ).
fof(f17,plain,
( sP0
| ~ p1
| ~ p3
| p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
( sP0
| p2
| p3
| p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
( sP0
| ~ p2
| ~ p3
| p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
( ~ sP0
| p1
| ~ p2
| p3 ),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
( ~ sP0
| p1
| ~ p3
| p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,plain,
( ~ sP0
| ~ p1
| p2
| p3 ),
inference(cnf_transformation,[],[f7]) ).
fof(f23,plain,
( ~ sP0
| ~ p1
| ~ p2
| ~ p3 ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_57,negated_conjecture,
( ~ p1
| ~ p2
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_58,negated_conjecture,
( p2
| p3
| ~ p1
| ~ sP0 ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_59,negated_conjecture,
( p1
| p2
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_60,negated_conjecture,
( p1
| p3
| ~ p2
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_61,negated_conjecture,
( p1
| sP0
| ~ p2
| ~ p3 ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_62,negated_conjecture,
( p1
| p2
| p3
| sP0 ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_63,negated_conjecture,
( p2
| sP0
| ~ p1
| ~ p3 ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_64,negated_conjecture,
( p3
| sP0
| ~ p1
| ~ p2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f4,definition,
( sP0
<=> ( ( p1
<=> p2 )
<=> p3 ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f5,plain,
( sP0
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(definition_folding,[],[f3,f4]) ).
fof(f6,plain,
( ( ~ sP0
| ( ( ( ( p1
| p2 )
& ( ~ p1
| ~ p2 ) )
| p3 )
& ( ~ p3
| ( ( ~ p1
| p2 )
& ( ~ p2
| p1 ) ) ) ) )
& ( ( ( ( ( ~ p1
| p2 )
& ( ~ p2
| p1 ) )
| p3 )
& ( ( ( p1
| p2 )
& ( ~ p1
| ~ p2 ) )
| ~ p3 ) )
| sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f8,plain,
( ~ sP0
| p1
| p2
| p3 ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
( ~ sP0
| ~ p1
| ~ p2
| p3 ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
( ~ sP0
| ~ p3
| ~ p1
| p2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
( ~ sP0
| ~ p3
| ~ p2
| p1 ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
( ~ p1
| p2
| p3
| sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f13,plain,
( ~ p2
| p1
| p3
| sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f14,plain,
( p1
| p2
| ~ p3
| sP0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f15,plain,
( ~ p1
| ~ p2
| ~ p3
| sP0 ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,plain,
( sP0
| ~ p1
| ~ p2
| ~ p3 ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_50,plain,
( p1
| p2
| sP0
| ~ p3 ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_51,plain,
( p1
| p3
| sP0
| ~ p2 ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_52,plain,
( p2
| p3
| sP0
| ~ p1 ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_53,plain,
( p1
| ~ p2
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_54,plain,
( p2
| ~ p1
| ~ p3
| ~ sP0 ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_55,plain,
( p3
| ~ p1
| ~ p2
| ~ sP0 ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_56,plain,
( p1
| p2
| p3
| ~ sP0 ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_65,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_57,c_49,c_53,c_54,c_55,c_58,c_59,c_60,c_61,c_63,c_64,c_50,c_51,c_52,c_56,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN393+1.003 : 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.39 % Computer : n026.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Fri Sep 25 01:07:11 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.43 Running first-order theorem proving
% 0.09/0.43 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.09/0.44
% 0.09/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.44
% 0.09/0.44 % Detected problem language: tptp
% 0.09/0.45 % Proving...
% 0.43/1.30 % SZS status Started for theBenchmark.p
% 0.43/1.30 % SZS status Theorem for theBenchmark.p
% 0.43/1.30
% 0.43/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/1.30
% 0.43/1.30 % ------ iProver source info
% 0.43/1.30
% 0.43/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.43/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/1.30 % git: non_committed_changes: false
% 0.43/1.30
% 0.43/1.30 % ------ Parsing...
% 0.43/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.43/1.30 %
% 0.43/1.30
% 0.43/1.30 % ------ Preprocessing...%
% 0.43/1.30
% 0.43/1.30 % SZS status Theorem for theBenchmark.p
% 0.43/1.30
% 0.43/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.30
% 0.43/1.30
%------------------------------------------------------------------------------