%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN936+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:45:28 PM UTC 2026
% Result : Theorem 1.46s 1.27s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f15ERROR: Could not build tree for root c_88ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X0] : p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( ~ c
| p(X0) )
<~> ( ~ c
| ! [X1] : p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X0] :
( ~ c
| p(X0) )
| ~ c
| ! [X1] : p(X1) )
& ( ? [X0] :
( c
& ~ p(X0) )
| ( c
& ? [X1] : ~ p(X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X0] :
( ~ c
| p(X0) )
| ~ c
| ! [X1] : p(X1) )
& ( ? [X0] :
( c
& ~ p(X0) )
| ( c
& ? [X1] : ~ p(X1) ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ! [X3] :
( ~ c
| p(X3) )
| ~ c
| ! [X2] : p(X2) )
& ( ? [X1] :
( c
& ~ p(X1) )
| ( c
& ? [X0] : ~ p(X0) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ( ! [X3] :
( ~ c
| p(X3) )
| ~ c
| ! [X2] : p(X2) )
& ( ( c
& ~ p(sK1) )
| ( c
& ~ p(sK0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
fof(f13,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_52,negated_conjecture,
c,
inference(cnf_transformation,[],[f14]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( p(X1)
| p(X0)
| ~ c ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_54,plain,
( p(sK0)
| ~ c ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_59,negated_conjecture,
! [X0: $i,X1: $i] :
( p(X1)
| p(X0) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_52,c_53]) ).
tcf(c_62,negated_conjecture,
~ p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_52,c_54,c_49]) ).
tcf(c_78,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| p(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_59]) ).
tcf(c_79,negated_conjecture,
iPr_def_10,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_59]) ).
tcf(c_80,negated_conjecture,
~ p(sK1),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_81,negated_conjecture,
iPr_def_10,
inference(demodulation,[status(thm)],[c_79]) ).
tcf(c_83,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_86,negated_conjecture,
! [X0: $i] : p(X0),
inference(global_subsumption_just,[status(thm)],[c_83,c_81,c_83]) ).
tcf(c_88,plain,
$false,
inference(resolution,[status(thm)],[c_86,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN936+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n007.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 02:33:38 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.46/1.27 % SZS status Started for theBenchmark.p
% 1.46/1.27 % SZS status Theorem for theBenchmark.p
% 1.46/1.27
% 1.46/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.46/1.27
% 1.46/1.27 % ------ iProver source info
% 1.46/1.27
% 1.46/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.46/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.46/1.27 % git: non_committed_changes: false
% 1.46/1.27
% 1.46/1.27 % ------ Parsing...
% 1.46/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.46/1.27
% 1.46/1.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.46/1.27 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.46/1.27 % ------ Proving...
% 1.46/1.27 % ------ Problem Properties
% 1.46/1.27
% 1.46/1.27 %
% 1.46/1.27 % clauses 3
% 1.46/1.27 % conjectures 3
% 1.46/1.27 % EPR 3
% 1.46/1.27 % Horn 3
% 1.46/1.27 % unary 2
% 1.46/1.27 % binary 1
% 1.46/1.27 % lits 4
% 1.46/1.27 % lits eq 0
% 1.46/1.27 % fd_pure 0
% 1.46/1.27 % fd_pseudo 0
% 1.46/1.27 % fd_cond 0
% 1.46/1.27 % fd_pseudo_cond 0
% 1.46/1.27 % AC symbols 0
% 1.46/1.27
% 1.46/1.27 % ------ Schedule EPR Horn non eq is on
% 1.46/1.27
% 1.46/1.27 % ------ no equalities: superposition off
% 1.46/1.27
% 1.46/1.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.46/1.27
% 1.46/1.27
% 1.46/1.27 % ------
% 1.46/1.27 % Current options:
% 1.46/1.27 % ------
% 1.46/1.27
% 1.46/1.27
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % ------ Proving...
% 1.46/1.27 %
% 1.46/1.27
% 1.46/1.27 % SZS status Theorem for theBenchmark.p
% 1.46/1.27
% 1.46/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.46/1.27
% 1.46/1.27
%------------------------------------------------------------------------------