%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:34 PM UTC 2026
% Result : Unsatisfiable 1.24s 6.16s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 62 ( 21 unt; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 143 ( 73 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 18 ( 17 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
fof(f7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
fof(f9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
fof(f13,axiom,
r0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f17,axiom,
! [X0] : q0(X0,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
fof(f28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
fof(f32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
fof(f39,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| k1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
fof(f45,axiom,
! [X2,X0,X1] :
( ~ r0(X0)
| ~ p0(X2,X1)
| m1(X0,X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_007) ).
fof(f106,axiom,
! [X0] :
( ~ k0(X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_068) ).
fof(f155,axiom,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_117) ).
fof(f162,axiom,
! [X0,X1] :
( ~ q1(d,X1,d)
| ~ s0(d)
| ~ q0(X0,X1)
| r1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
fof(f178,axiom,
! [X0,X1] :
( ~ p1(b,X0,X1)
| ~ r0(e)
| ~ r1(b)
| n2(e) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_140) ).
fof(f193,axiom,
! [X2,X0,X1] :
( ~ p2(e,X0,X1)
| ~ k1(X2)
| p2(X0,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_155) ).
fof(f214,axiom,
! [X0,X1] :
( ~ m1(X1,X0,X1)
| p2(X0,X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
fof(f274,axiom,
! [X0] :
( ~ n2(X0)
| m3(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
fof(f289,axiom,
! [X2,X3,X0,X1] :
( ~ p2(X0,X1,X3)
| ~ m3(X1,X2,X3)
| p3(X0,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_251) ).
fof(f369,negated_conjecture,
~ p3(b,e,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_418,plain,
s0(d),
inference(cnf_transformation,[],[f1]) ).
tcf(c_424,plain,
n0(d,b),
inference(cnf_transformation,[],[f7]) ).
tcf(c_426,plain,
r0(b),
inference(cnf_transformation,[],[f9]) ).
tcf(c_430,plain,
r0(e),
inference(cnf_transformation,[],[f13]) ).
tcf(c_431,plain,
! [X0: $i] : p0(b,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_434,plain,
! [X0: $i] : q0(X0,d),
inference(cnf_transformation,[],[f17]) ).
tcf(c_445,plain,
k0(e),
inference(cnf_transformation,[],[f28]) ).
tcf(c_449,plain,
k0(b),
inference(cnf_transformation,[],[f32]) ).
tcf(c_456,plain,
! [X0: $i,X1: $i] :
( k1(X1)
| ~ n0(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_462,plain,
! [X0: $i,X1: $i,X2: $i] :
( m1(X2,X1,X2)
| ~ r0(X2)
| ~ p0(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_522,plain,
! [X0: $i] :
( p1(X0,X0,X0)
| ~ k0(X0) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_570,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_577,plain,
! [X0: $i,X1: $i] :
( r1(X1)
| ~ s0(d)
| ~ q0(X1,X0)
| ~ q1(d,X0,d) ),
inference(cnf_transformation,[],[f162]) ).
tcf(c_592,plain,
! [X0: $i,X1: $i] :
( n2(e)
| ~ r1(b)
| ~ r0(e)
| ~ p1(b,X0,X1) ),
inference(cnf_transformation,[],[f178]) ).
tcf(c_607,plain,
! [X0: $i,X1: $i,X2: $i] :
( p2(X0,X1,X1)
| ~ k1(X2)
| ~ p2(e,X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_628,plain,
! [X0: $i,X1: $i] :
( p2(X1,X0,X1)
| ~ m1(X0,X1,X0) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_686,plain,
! [X0: $i] :
( m3(X0,X0,X0)
| ~ n2(X0) ),
inference(cnf_transformation,[],[f274]) ).
tcf(c_701,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p3(X0,X1,X1)
| ~ m3(X1,X3,X2)
| ~ p2(X0,X1,X2) ),
inference(cnf_transformation,[],[f289]) ).
tcf(c_768,negated_conjecture,
~ p3(b,e,e),
inference(cnf_transformation,[],[f369]) ).
tcf(c_769,plain,
q0(b,d),
inference(instantiation,[status(thm)],[c_434]) ).
tcf(c_790,plain,
( p1(b,b,b)
| ~ k0(b) ),
inference(instantiation,[status(thm)],[c_522]) ).
tcf(c_888,plain,
( n2(e)
| ~ r1(b)
| ~ r0(e)
| ~ p1(b,b,b) ),
inference(instantiation,[status(thm)],[c_592]) ).
tcf(c_1015,plain,
( n2(e)
| ~ r1(b) ),
inference(global_subsumption_just,[status(thm)],[c_592,c_449,c_430,c_790,c_888]) ).
tcf(c_1027,plain,
! [X0: $i,X1: $i] :
( r1(X1)
| ~ q1(d,X0,d)
| ~ q0(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_577,c_418,c_577]) ).
tcf(c_1028,plain,
! [X0: $i,X1: $i] :
( r1(X1)
| ~ q0(X1,X0)
| ~ q1(d,X0,d) ),
inference(renaming,[status(thm)],[c_1027]) ).
tcf(c_1120,plain,
! [X0: $i] :
( ~ iPr_def_50
| ~ k1(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_50])],[c_607]) ).
tcf(c_1121,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_51
| ~ p2(e,X0,X1)
| p2(X0,X1,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_51])],[c_607]) ).
tcf(c_1122,plain,
( iPr_def_51
| iPr_def_50 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_607]) ).
tcf(c_1185,plain,
( ~ iPr_def_50
| ~ k1(b) ),
inference(instantiation,[status(thm)],[c_1120]) ).
tcf(c_1252,plain,
! [X0: $i,X1: $i] :
( p3(b,e,e)
| ~ p2(b,e,X1)
| ~ m3(e,X0,X1) ),
inference(instantiation,[status(thm)],[c_701]) ).
tcf(c_1262,plain,
( k1(b)
| ~ n0(d,b) ),
inference(instantiation,[status(thm)],[c_456]) ).
tcf(c_1310,plain,
( m3(e,e,e)
| ~ n2(e) ),
inference(instantiation,[status(thm)],[c_686]) ).
tcf(c_1320,plain,
! [X0: $i] :
( r1(X0)
| ~ q0(X0,d)
| ~ q1(d,d,d) ),
inference(instantiation,[status(thm)],[c_1028]) ).
tcf(c_1321,plain,
( r1(b)
| ~ q0(b,d)
| ~ q1(d,d,d) ),
inference(instantiation,[status(thm)],[c_1320]) ).
tcf(c_1458,plain,
! [X0: $i] :
( p2(e,X0,e)
| ~ m1(X0,e,X0) ),
inference(instantiation,[status(thm)],[c_628]) ).
tcf(c_1460,plain,
( p2(e,b,e)
| ~ m1(b,e,b) ),
inference(instantiation,[status(thm)],[c_1458]) ).
tcf(c_1653,plain,
( p3(b,e,e)
| ~ m3(e,e,e)
| ~ p2(b,e,e) ),
inference(instantiation,[status(thm)],[c_1252]) ).
tcf(c_1720,plain,
! [X0: $i,X1: $i] :
( m1(X1,e,X1)
| ~ r0(X1)
| ~ p0(X0,e) ),
inference(instantiation,[status(thm)],[c_462]) ).
tcf(c_1721,plain,
( m1(b,e,b)
| ~ r0(b)
| ~ p0(b,e) ),
inference(instantiation,[status(thm)],[c_1720]) ).
tcf(c_1793,plain,
p0(b,e),
inference(instantiation,[status(thm)],[c_431]) ).
tcf(c_1831,plain,
! [X0: $i] :
( p2(X0,e,e)
| ~ iPr_def_51
| ~ p2(e,X0,e) ),
inference(instantiation,[status(thm)],[c_1121]) ).
tcf(c_1832,plain,
( p2(b,e,e)
| ~ iPr_def_51
| ~ p2(e,b,e) ),
inference(instantiation,[status(thm)],[c_1831]) ).
tcf(c_1833,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1832,c_1793,c_1721,c_1653,c_1460,c_1321,c_1310,c_1262,c_1185,c_1122,c_1015,c_570,c_768,c_424,c_769,c_418,c_426,c_445]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.39 % Computer : n017.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Fri Sep 25 00:36:07 UTC 2026
% 0.16/5.40 % CPUTime :
% 0.16/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/5.44 Running EPR theorem proving
% 0.16/5.44 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.45
% 0.16/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.45
% 0.16/5.45 % Detected problem language: tptp
% 0.16/5.46 % Proving...
% 1.24/6.16 % SZS status Started for theBenchmark.p
% 1.24/6.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/6.16
% 1.24/6.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.24/6.16
% 1.24/6.16 % ------ iProver source info
% 1.24/6.16
% 1.24/6.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.24/6.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.24/6.16 % git: non_committed_changes: false
% 1.24/6.16
% 1.24/6.16 % ------ Parsing...% successful
% 1.24/6.16
% 1.24/6.16
% 1.24/6.16 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.24/6.16 %
% 1.24/6.16
% 1.24/6.16 % ------ Preprocessing... sf_s rm: 76 0s sf_e sf_s rm: 0 0s sf_e %
% 1.24/6.16
% 1.24/6.16 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.24/6.16 gs_s sp: 88 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.24/6.16 % ------ Proving...
% 1.24/6.16 % ------ Problem Properties
% 1.24/6.16
% 1.24/6.16 %
% 1.24/6.16 % clauses 332
% 1.24/6.16 % conjectures 1
% 1.24/6.16 % EPR 332
% 1.24/6.16 % Horn 289
% 1.24/6.16 % unary 51
% 1.24/6.16 % binary 137
% 1.24/6.16 % lits 809
% 1.24/6.16 % lits eq 0
% 1.24/6.16 % fd_pure 0
% 1.24/6.16 % fd_pseudo 0
% 1.24/6.16 % fd_cond 0
% 1.24/6.16 % fd_pseudo_cond 0
% 1.24/6.16 % AC symbols 0
% 1.24/6.16
% 1.24/6.16 % ------ Schedule EPR non Horn non eq is on
% 1.24/6.16
% 1.24/6.16 % ------ no equalities: superposition off
% 1.24/6.16
% 1.24/6.16 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.24/6.16
% 1.24/6.16
% 1.24/6.16 % ------
% 1.24/6.16 % Current options:
% 1.24/6.16 % ------
% 1.24/6.16
% 1.24/6.16
% 1.24/6.16 %
% 1.24/6.16
% 1.24/6.16 % ------ Proving...
% 1.24/6.16 %
% 1.24/6.16
% 1.24/6.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/6.16
% 1.24/6.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.24/6.17
% 1.24/6.17
%------------------------------------------------------------------------------