%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN724+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:41:29 PM UTC 2026
% Result : Theorem 1.17s 1.30s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f24ERROR: Could not build tree for root c_84ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( r(X0)
=> s(X0) )
<=> ! [X0] :
( ( s(X0)
& r(X0) )
<=> r(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm31) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( r(X0)
=> s(X0) )
<=> ! [X0] :
( ( s(X0)
& r(X0) )
<=> r(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( r(X0)
=> s(X0) )
<=> ! [X1] :
( ( s(X1)
& r(X1) )
<=> r(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( ~ r(X0)
| s(X0) )
<~> ! [X1] :
( ( s(X1)
& r(X1) )
<=> r(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
( ( ! [X0] :
( ~ r(X0)
| s(X0) )
| sP0 )
& ( ? [X0] :
( r(X0)
& ~ s(X0) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f12,plain,
( ( ! [X1] :
( ~ r(X1)
| s(X1) )
| sP0 )
& ( ? [X0] :
( r(X0)
& ~ s(X0) )
| ~ sP0 ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
( ( ! [X1] :
( ~ r(X1)
| s(X1) )
| sP0 )
& ( ( r(sK2)
& ~ s(sK2) )
| ~ sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f12]) ).
fof(f20,plain,
! [X1] :
( ~ r(X1)
| s(X1)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
( r(sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
( ~ s(sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_49,plain,
( sP0
| ~ s(sK1)
| ~ r(sK1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_50,plain,
( sP0
| r(sK1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_53,negated_conjecture,
( ~ sP0
| ~ s(sK2) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_54,negated_conjecture,
( r(sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( sP0
| s(X0)
| ~ r(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_56,plain,
( sP0
| s(sK1)
| ~ r(sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_58,plain,
sP0,
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_56,c_49]) ).
tcf(c_60,negated_conjecture,
r(sK2),
inference(global_subsumption_just,[status(thm)],[c_54,c_50,c_54,c_56,c_49]) ).
fof(f5,definition,
( sP0
<=> ! [X1] :
( ( s(X1)
& r(X1) )
<=> r(X1) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f6,plain,
( ! [X0] :
( ~ r(X0)
| s(X0) )
<~> sP0 ),
inference(definition_folding,[],[f4,f5]) ).
fof(f7,plain,
( ( ~ sP0
| ! [X1] :
( ( ~ s(X1)
| ~ r(X1)
| r(X1) )
& ( ~ r(X1)
| ( s(X1)
& r(X1) ) ) ) )
& ( ? [X1] :
( ( ( s(X1)
& r(X1) )
| r(X1) )
& ( ~ s(X1)
| ~ r(X1)
| ~ r(X1) ) )
| sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f8,plain,
( ( ~ sP0
| ! [X1] :
( ( ~ s(X1)
| ~ r(X1)
| r(X1) )
& ( ~ r(X1)
| ( s(X1)
& r(X1) ) ) ) )
& ( ? [X1] :
( ( ( s(X1)
& r(X1) )
| r(X1) )
& ( ~ s(X1)
| ~ r(X1)
| ~ r(X1) ) )
| sP0 ) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
( ( ~ sP0
| ! [X1] :
( ( ~ s(X1)
| ~ r(X1)
| r(X1) )
& ( ~ r(X1)
| ( s(X1)
& r(X1) ) ) ) )
& ( ? [X0] :
( ( ( s(X0)
& r(X0) )
| r(X0) )
& ( ~ s(X0)
| ~ r(X0)
| ~ r(X0) ) )
| sP0 ) ),
inference(rectify,[],[f8]) ).
fof(f10,plain,
( ( ~ sP0
| ! [X1] :
( ( ~ s(X1)
| ~ r(X1)
| r(X1) )
& ( ~ r(X1)
| ( s(X1)
& r(X1) ) ) ) )
& ( ( ( ( s(sK1)
& r(sK1) )
| r(sK1) )
& ( ~ s(sK1)
| ~ r(sK1)
| ~ r(sK1) ) )
| sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f9]) ).
fof(f15,plain,
! [X1] :
( ~ sP0
| ~ r(X1)
| s(X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,plain,
! [X0: $i] :
( s(X0)
| ~ sP0
| ~ r(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_68,plain,
! [X0: $i] :
( s(X0)
| ~ r(X0) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_58]) ).
tcf(c_83,plain,
s(sK2),
inference(resolution,[status(thm)],[c_68,c_60]) ).
tcf(c_84,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_83,c_58,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN724+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 02:09:23 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 1.17/1.30 % SZS status Started for theBenchmark.p
% 1.17/1.30 % SZS status Theorem for theBenchmark.p
% 1.17/1.30
% 1.17/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.17/1.30
% 1.17/1.30 % ------ iProver source info
% 1.17/1.30
% 1.17/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.17/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.17/1.30 % git: non_committed_changes: false
% 1.17/1.30
% 1.17/1.30 % ------ Parsing...
% 1.17/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.17/1.30 %
% 1.17/1.30
% 1.17/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s %
% 1.17/1.30
% 1.17/1.30 % SZS status Theorem for theBenchmark.p
% 1.17/1.30
% 1.17/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.17/1.30
% 1.17/1.30
%------------------------------------------------------------------------------