%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN214-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:27 PM UTC 2026
% Result : Unsatisfiable 3.10s 1.14s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of formulae : 62 ( 16 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 146 ( 75 ~; 71 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 22 ( 21 usr; 5 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 67 ( 0 sgn 67 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
fof(f7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
fof(f32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
fof(f34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
fof(f70,axiom,
! [X0] :
( ~ s0(X0)
| m1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_032) ).
fof(f104,axiom,
! [X0,X1] :
( ~ n0(X1,X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_066) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
fof(f171,axiom,
! [X2,X3,X0,X1] :
( ~ m0(X3,X2,X0)
| ~ s1(X2)
| ~ p0(X1,X1)
| l2(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).
fof(f188,axiom,
! [X0,X1] :
( ~ m1(X1,X1,X0)
| p2(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_150) ).
fof(f215,axiom,
! [X0,X1] :
( ~ p1(X0,X0,X0)
| ~ k0(X1)
| q2(X0,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_177) ).
fof(f278,axiom,
! [X2,X0,X1] :
( ~ p2(X1,X2,X0)
| n3(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
fof(f284,axiom,
! [X0] :
( ~ l2(X0,X0)
| p3(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_246) ).
fof(f293,axiom,
! [X2,X0,X1] :
( ~ n0(X2,X0)
| ~ q2(X2,X0,X1)
| q3(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
fof(f315,axiom,
! [X2,X0,X1] :
( ~ p3(X1,X2,X0)
| l4(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_277) ).
fof(f336,axiom,
! [X2,X3,X0,X1] :
( ~ p0(X3,X0)
| ~ q3(X1,X2)
| ~ n3(X0)
| r4(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_298) ).
fof(f367,axiom,
! [X0,X1] :
( ~ r4(X1)
| ~ l4(X0)
| s5(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_329) ).
fof(f369,negated_conjecture,
~ s5(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_418,negated_conjecture,
~ s5(c),
inference(cnf_transformation,[],[f369]) ).
tcf(c_427,plain,
m0(e,b,c),
inference(cnf_transformation,[],[f27]) ).
tcf(c_432,plain,
! [X0: $i,X1: $i] :
( s5(X0)
| ~ r4(X1)
| ~ l4(X0) ),
inference(cnf_transformation,[],[f367]) ).
tcf(c_487,plain,
! [X0: $i,X1: $i] :
( p2(X1,X1,X1)
| ~ m1(X0,X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_521,plain,
! [X0: $i] : p0(b,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_532,plain,
! [X0: $i,X1: $i,X2: $i] :
( l4(X2)
| ~ p3(X0,X1,X2) ),
inference(cnf_transformation,[],[f315]) ).
tcf(c_534,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X0,X1) ),
inference(cnf_transformation,[],[f336]) ).
tcf(c_542,plain,
! [X0: $i] :
( m1(X0,X0,X0)
| ~ s0(X0) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_547,plain,
s0(b),
inference(cnf_transformation,[],[f5]) ).
tcf(c_603,plain,
! [X0: $i,X1: $i] :
( p1(X1,X1,X1)
| ~ n0(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_609,plain,
n0(c,d),
inference(cnf_transformation,[],[f34]) ).
tcf(c_614,plain,
n0(d,b),
inference(cnf_transformation,[],[f7]) ).
tcf(c_625,plain,
! [X0: $i] :
( p3(X0,X0,X0)
| ~ l2(X0,X0) ),
inference(cnf_transformation,[],[f284]) ).
tcf(c_632,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( l2(X2,X2)
| ~ s1(X1)
| ~ p0(X3,X3)
| ~ m0(X0,X1,X2) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_643,plain,
! [X0: $i,X1: $i] :
( q2(X0,X1,X1)
| ~ k0(X1)
| ~ p1(X0,X0,X0) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_664,plain,
! [X0: $i] :
( s1(X0)
| ~ p0(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_688,plain,
! [X0: $i,X1: $i,X2: $i] :
( q3(X1,X2)
| ~ n0(X0,X1)
| ~ q2(X0,X1,X2) ),
inference(cnf_transformation,[],[f293]) ).
tcf(c_702,plain,
! [X0: $i,X1: $i,X2: $i] :
( n3(X2)
| ~ p2(X0,X1,X2) ),
inference(cnf_transformation,[],[f278]) ).
tcf(c_728,plain,
k0(b),
inference(cnf_transformation,[],[f32]) ).
tcf(c_770,plain,
p0(b,b),
inference(instantiation,[status(thm)],[c_521]) ).
tcf(c_774,plain,
( s1(b)
| ~ p0(b,b) ),
inference(instantiation,[status(thm)],[c_664]) ).
tcf(c_782,plain,
( n3(b)
| ~ p2(b,b,b) ),
inference(instantiation,[status(thm)],[c_702]) ).
tcf(c_790,plain,
( m1(b,b,b)
| ~ s0(b) ),
inference(instantiation,[status(thm)],[c_542]) ).
tcf(c_823,plain,
( p2(b,b,b)
| ~ m1(b,b,b) ),
inference(instantiation,[status(thm)],[c_487]) ).
tcf(c_890,plain,
( r4(b)
| ~ n3(b)
| ~ q3(b,b)
| ~ p0(b,b) ),
inference(instantiation,[status(thm)],[c_534]) ).
tcf(c_1147,plain,
! [X0: $i] :
( ~ iPr_def_66
| ~ r4(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_66])],[c_432]) ).
tcf(c_1148,plain,
! [X0: $i] :
( ~ iPr_def_67
| s5(X0)
| ~ l4(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_67])],[c_432]) ).
tcf(c_1149,plain,
( iPr_def_67
| iPr_def_66 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_432]) ).
tcf(c_1156,plain,
! [X0: $i] :
( ~ iPr_def_72
| ~ p0(X0,X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_72])],[c_632]) ).
tcf(c_1157,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_73
| ~ s1(X1)
| l2(X2,X2)
| ~ m0(X0,X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_73])],[c_632]) ).
tcf(c_1158,plain,
( iPr_def_73
| iPr_def_72 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_632]) ).
tcf(c_1211,plain,
( ~ iPr_def_66
| ~ r4(b) ),
inference(instantiation,[status(thm)],[c_1147]) ).
tcf(c_1221,plain,
( ~ iPr_def_72
| ~ p0(b,b) ),
inference(instantiation,[status(thm)],[c_1156]) ).
tcf(c_1431,plain,
( p1(d,d,d)
| ~ n0(c,d) ),
inference(instantiation,[status(thm)],[c_603]) ).
tcf(c_1514,plain,
( l2(c,c)
| ~ iPr_def_73
| ~ s1(b)
| ~ m0(e,b,c) ),
inference(instantiation,[status(thm)],[c_1157]) ).
tcf(c_1553,plain,
! [X0: $i] :
( q3(b,X0)
| ~ n0(d,b)
| ~ q2(d,b,X0) ),
inference(instantiation,[status(thm)],[c_688]) ).
tcf(c_1554,plain,
( q3(b,b)
| ~ n0(d,b)
| ~ q2(d,b,b) ),
inference(instantiation,[status(thm)],[c_1553]) ).
tcf(c_1937,plain,
( q2(d,b,b)
| ~ k0(b)
| ~ p1(d,d,d) ),
inference(instantiation,[status(thm)],[c_643]) ).
tcf(c_2511,plain,
( s5(c)
| ~ iPr_def_67
| ~ l4(c) ),
inference(instantiation,[status(thm)],[c_1148]) ).
tcf(c_2608,plain,
! [X0: $i,X1: $i] :
( l4(c)
| ~ p3(X0,X1,c) ),
inference(instantiation,[status(thm)],[c_532]) ).
tcf(c_3192,plain,
( l4(c)
| ~ p3(c,c,c) ),
inference(instantiation,[status(thm)],[c_2608]) ).
tcf(c_3193,plain,
( p3(c,c,c)
| ~ l2(c,c) ),
inference(instantiation,[status(thm)],[c_625]) ).
tcf(c_3197,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3193,c_3192,c_2511,c_1937,c_1554,c_1514,c_1431,c_1221,c_1211,c_1158,c_1149,c_890,c_823,c_790,c_782,c_774,c_427,c_770,c_609,c_614,c_418,c_547,c_728]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN214-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 00:31:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running EPR theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.10/1.14 % SZS status Started for theBenchmark.p
% 3.10/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.14
% 3.10/1.14 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.10/1.14
% 3.10/1.14 % ------ iProver source info
% 3.10/1.14
% 3.10/1.14 % git: date: 2026-07-19 20:42:38 +0200
% 3.10/1.14 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.10/1.14 % git: non_committed_changes: false
% 3.10/1.14
% 3.10/1.14 % ------ Parsing...% successful
% 3.10/1.14
% 3.10/1.14
% 3.10/1.14 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 3.10/1.14 %
% 3.10/1.14
% 3.10/1.14 % ------ Preprocessing... sf_s rm: 46 0s sf_e sf_s rm: 0 0s sf_e %
% 3.10/1.14
% 3.10/1.14 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 3.10/1.14 gs_s sp: 104 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.10/1.14 % ------ Proving...
% 3.10/1.14 % ------ Problem Properties
% 3.10/1.14
% 3.10/1.14 %
% 3.10/1.14 % clauses 376
% 3.10/1.14 % conjectures 1
% 3.10/1.14 % EPR 376
% 3.10/1.14 % Horn 325
% 3.10/1.14 % unary 52
% 3.10/1.14 % binary 151
% 3.10/1.14 % lits 938
% 3.10/1.14 % lits eq 0
% 3.10/1.14 % fd_pure 0
% 3.10/1.14 % fd_pseudo 0
% 3.10/1.14 % fd_cond 0
% 3.10/1.14 % fd_pseudo_cond 0
% 3.10/1.14 % AC symbols 0
% 3.10/1.14
% 3.10/1.14 % ------ Schedule EPR non Horn non eq is on
% 3.10/1.14
% 3.10/1.14 % ------ no equalities: superposition off
% 3.10/1.14
% 3.10/1.14 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.10/1.14
% 3.10/1.14
% 3.10/1.14 % ------
% 3.10/1.14 % Current options:
% 3.10/1.14 % ------
% 3.10/1.14
% 3.10/1.14
% 3.10/1.14 %
% 3.10/1.14
% 3.10/1.14 % ------ Proving...
% 3.10/1.14 %
% 3.10/1.14
% 3.10/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.14
% 3.10/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/1.14
% 3.10/1.14
%------------------------------------------------------------------------------