%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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 02:33:00 PM UTC 2026
% Result : Theorem 1.64s 1.28s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 21 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 18 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 12 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).
fof(f2,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).
fof(f3,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).
fof(f4,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).
fof(f5,axiom,
patricide(oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).
fof(f6,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).
fof(f7,conjecture,
? [X0,X1] :
( ~ patricide(X1)
& parent_of(X0,X1)
& patricide(X0)
& parent_of(iokaste,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
fof(f8,negated_conjecture,
~ ? [X0,X1] :
( ~ patricide(X1)
& parent_of(X0,X1)
& patricide(X0)
& parent_of(iokaste,X0) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( patricide(X1)
| ~ parent_of(X0,X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f10,plain,
parent_of(iokaste,oedipus),
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
parent_of(iokaste,polyneikes),
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
parent_of(oedipus,polyneikes),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
parent_of(polyneikes,thersandros),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
patricide(oedipus),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
~ patricide(thersandros),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X0,X1] :
( patricide(X1)
| ~ parent_of(X0,X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
parent_of(iokaste,oedipus),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
parent_of(iokaste,polyneikes),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
parent_of(oedipus,polyneikes),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
parent_of(polyneikes,thersandros),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,plain,
patricide(oedipus),
inference(cnf_transformation,[],[f14]) ).
tcf(c_54,plain,
~ patricide(thersandros),
inference(cnf_transformation,[],[f15]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i] :
( patricide(X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0)
| ~ parent_of(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_56,negated_conjecture,
! [X0: $i,X1: $i] :
( patricide(X1)
| ~ patricide(X0)
| ~ parent_of(iokaste,X0)
| ~ parent_of(X0,X1) ),
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_57,plain,
! [X0: $i] :
( patricide(X0)
| ~ parent_of(iokaste,oedipus)
| ~ parent_of(oedipus,X0) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
tcf(c_59,plain,
! [X0: $i] :
( patricide(X0)
| ~ parent_of(oedipus,X0) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_49,c_57]) ).
tcf(c_62,plain,
patricide(polyneikes),
inference(resolution,[status(thm)],[c_51,c_59]) ).
tcf(c_63,plain,
! [X0: $i] :
( patricide(X0)
| ~ parent_of(iokaste,polyneikes)
| ~ parent_of(polyneikes,X0) ),
inference(resolution,[status(thm)],[c_62,c_56]) ).
tcf(c_65,plain,
! [X0: $i] :
( patricide(X0)
| ~ parent_of(polyneikes,X0) ),
inference(global_subsumption_just,[status(thm)],[c_63,c_50,c_63]) ).
tcf(c_68,plain,
patricide(thersandros),
inference(resolution,[status(thm)],[c_52,c_65]) ).
tcf(c_69,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_68,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 07:04:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.64/1.28 % SZS status Started for theBenchmark.p
% 1.64/1.28 % SZS status Theorem for theBenchmark.p
% 1.64/1.28
% 1.64/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.28
% 1.64/1.28 % ------ iProver source info
% 1.64/1.28
% 1.64/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.28 % git: non_committed_changes: false
% 1.64/1.28
% 1.64/1.28 % ------ Parsing...
% 1.64/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.64/1.28 %
% 1.64/1.28
% 1.64/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 1.64/1.28
% 1.64/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.64/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.64/1.28 % ------ Proving...
% 1.64/1.28 % ------ Problem Properties
% 1.64/1.28
% 1.64/1.28 %
% 1.64/1.28 % clauses 7
% 1.64/1.28 % conjectures 1
% 1.64/1.28 % EPR 7
% 1.64/1.28 % Horn 7
% 1.64/1.28 % unary 6
% 1.64/1.28 % binary 0
% 1.64/1.28 % lits 10
% 1.64/1.28 % lits eq 0
% 1.64/1.28 % fd_pure 0
% 1.64/1.28 % fd_pseudo 0
% 1.64/1.28 % fd_cond 0
% 1.64/1.28 % fd_pseudo_cond 0
% 1.64/1.28 % AC symbols 0
% 1.64/1.28
% 1.64/1.28 % ------ Schedule EPR Horn non eq is on
% 1.64/1.28
% 1.64/1.28 % ------ no equalities: superposition off
% 1.64/1.28
% 1.64/1.28 % ------ Option_epr_horn Time Limit: Unbounded
% 1.64/1.28
% 1.64/1.28
% 1.64/1.28 % ------
% 1.64/1.28 % Current options:
% 1.64/1.28 % ------
% 1.64/1.28
% 1.64/1.28
% 1.64/1.28 %
% 1.64/1.28
% 1.64/1.28 % ------ Proving...
% 1.64/1.28 %
% 1.64/1.28
% 1.64/1.28 % SZS status Theorem for theBenchmark.p
% 1.64/1.28
% 1.64/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.28
% 1.64/1.28
%------------------------------------------------------------------------------