%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN115-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 : n010.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:13 PM UTC 2026
% Result : Unsatisfiable 1.60s 1.13s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 103 ( 54 ~; 49 |; 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 : 16 ( 15 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
fof(f13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
fof(f18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
fof(f27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
fof(f30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
fof(f34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
fof(f41,axiom,
! [X2,X3,X0,X1] :
( ~ m0(X1,X0,X2)
| ~ r0(X3)
| ~ p0(X2,X0)
| l1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
fof(f95,axiom,
! [X0] :
( ~ r0(X0)
| n1(X0,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_057) ).
fof(f151,axiom,
! [X2,X0,X1] :
( ~ m1(X0,X1,X1)
| ~ r0(X2)
| q1(X0,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_113) ).
fof(f208,axiom,
! [X0] :
( ~ n1(X0,e,e)
| p2(X0,e,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_170) ).
fof(f224,axiom,
! [X0,X1] :
( ~ l1(X1,X0)
| q2(X0,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
fof(f278,axiom,
! [X2,X0,X1] :
( ~ p2(X1,X2,X0)
| n3(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
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(f312,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).
fof(f369,negated_conjecture,
~ k4(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_426,plain,
r0(b),
inference(cnf_transformation,[],[f9]) ).
tcf(c_430,plain,
r0(e),
inference(cnf_transformation,[],[f13]) ).
tcf(c_435,plain,
p0(c,b),
inference(cnf_transformation,[],[f18]) ).
tcf(c_444,plain,
m0(e,b,c),
inference(cnf_transformation,[],[f27]) ).
tcf(c_447,plain,
n0(e,e),
inference(cnf_transformation,[],[f30]) ).
tcf(c_451,plain,
n0(c,d),
inference(cnf_transformation,[],[f34]) ).
tcf(c_458,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( l1(X1,X0)
| ~ r0(X3)
| ~ p0(X2,X1)
| ~ m0(X0,X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_511,plain,
! [X0: $i] :
( n1(X0,X0,X0)
| ~ r0(X0) ),
inference(cnf_transformation,[],[f95]) ).
tcf(c_566,plain,
! [X0: $i,X1: $i,X2: $i] :
( q1(X0,X0,X1)
| ~ r0(X2)
| ~ m1(X0,X1,X1) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_622,plain,
! [X0: $i] :
( p2(X0,e,X0)
| ~ n1(X0,e,e) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_638,plain,
! [X0: $i,X1: $i] :
( q2(X1,X1,X0)
| ~ l1(X0,X1) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_690,plain,
! [X0: $i,X1: $i,X2: $i] :
( n3(X2)
| ~ p2(X0,X1,X2) ),
inference(cnf_transformation,[],[f278]) ).
tcf(c_705,plain,
! [X0: $i,X1: $i,X2: $i] :
( q3(X1,X2)
| ~ n0(X0,X1)
| ~ q2(X0,X1,X2) ),
inference(cnf_transformation,[],[f293]) ).
tcf(c_724,plain,
( k4(c)
| ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d) ),
inference(cnf_transformation,[],[f312]) ).
tcf(c_768,negated_conjecture,
~ k4(c),
inference(cnf_transformation,[],[f369]) ).
tcf(c_1010,plain,
( ~ q3(e,b)
| ~ n3(e) ),
inference(global_subsumption_just,[status(thm)],[c_724,c_768,c_451,c_724]) ).
tcf(c_1011,plain,
( ~ n3(e)
| ~ q3(e,b) ),
inference(renaming,[status(thm)],[c_1010]) ).
tcf(c_1103,plain,
! [X0: $i] :
( ~ iPr_def_39
| ~ r0(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_39])],[c_566]) ).
tcf(c_1144,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_64
| ~ p0(X2,X1)
| l1(X1,X0)
| ~ m0(X0,X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_64])],[c_458]) ).
tcf(c_1145,plain,
( iPr_def_64
| iPr_def_39 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_458]) ).
tcf(c_1150,plain,
( ~ iPr_def_39
| ~ r0(b) ),
inference(instantiation,[status(thm)],[c_1103]) ).
tcf(c_1222,plain,
( n1(e,e,e)
| ~ r0(e) ),
inference(instantiation,[status(thm)],[c_511]) ).
tcf(c_1223,plain,
( p2(e,e,e)
| ~ n1(e,e,e) ),
inference(instantiation,[status(thm)],[c_622]) ).
tcf(c_1433,plain,
! [X0: $i] :
( q3(e,X0)
| ~ n0(e,e)
| ~ q2(e,e,X0) ),
inference(instantiation,[status(thm)],[c_705]) ).
tcf(c_1434,plain,
( q3(e,b)
| ~ n0(e,e)
| ~ q2(e,e,b) ),
inference(instantiation,[status(thm)],[c_1433]) ).
tcf(c_1447,plain,
( l1(b,e)
| ~ iPr_def_64
| ~ p0(c,b)
| ~ m0(e,b,c) ),
inference(instantiation,[status(thm)],[c_1144]) ).
tcf(c_1627,plain,
! [X0: $i] :
( q2(e,e,X0)
| ~ l1(X0,e) ),
inference(instantiation,[status(thm)],[c_638]) ).
tcf(c_1628,plain,
( q2(e,e,b)
| ~ l1(b,e) ),
inference(instantiation,[status(thm)],[c_1627]) ).
tcf(c_1826,plain,
! [X0: $i,X1: $i] :
( n3(e)
| ~ p2(X0,X1,e) ),
inference(instantiation,[status(thm)],[c_690]) ).
tcf(c_1991,plain,
( n3(e)
| ~ p2(e,e,e) ),
inference(instantiation,[status(thm)],[c_1826]) ).
tcf(c_2002,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1991,c_1628,c_1447,c_1434,c_1223,c_1222,c_1150,c_1145,c_1011,c_444,c_435,c_447,c_426,c_430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN115-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.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 00:13:29 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.41 Running EPR theorem proving
% 0.09/0.41 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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.60/1.13 % SZS status Started for theBenchmark.p
% 1.60/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 1.60/1.13
% 1.60/1.13 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.60/1.13
% 1.60/1.13 % ------ iProver source info
% 1.60/1.13
% 1.60/1.13 % git: date: 2026-07-19 20:42:38 +0200
% 1.60/1.13 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.60/1.13 % git: non_committed_changes: false
% 1.60/1.13
% 1.60/1.13 % ------ Parsing...% successful
% 1.60/1.13
% 1.60/1.13
% 1.60/1.13 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.60/1.13 %
% 1.60/1.13
% 1.60/1.13 % ------ Preprocessing... sf_s rm: 129 0s sf_e sf_s rm: 0 0s sf_e %
% 1.60/1.13
% 1.60/1.13 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.60/1.13 gs_s sp: 64 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.60/1.13 % ------ Proving...
% 1.60/1.13 % ------ Problem Properties
% 1.60/1.13
% 1.60/1.13 %
% 1.60/1.13 % clauses 257
% 1.60/1.13 % conjectures 0
% 1.60/1.13 % EPR 257
% 1.60/1.13 % Horn 225
% 1.60/1.13 % unary 49
% 1.60/1.13 % binary 105
% 1.60/1.13 % lits 608
% 1.60/1.13 % lits eq 0
% 1.60/1.13 % fd_pure 0
% 1.60/1.13 % fd_pseudo 0
% 1.60/1.13 % fd_cond 0
% 1.60/1.13 % fd_pseudo_cond 0
% 1.60/1.13 % AC symbols 0
% 1.60/1.13
% 1.60/1.13 % ------ Schedule EPR non Horn non eq is on
% 1.60/1.13
% 1.60/1.13 % ------ no conjectures: strip conj schedule
% 1.60/1.13
% 1.60/1.13 % ------ no equalities: superposition off
% 1.60/1.13
% 1.60/1.13 % ------ Input Options "--resolution_flag false" stripped conjectures Time Limit: 70.
% 1.60/1.13
% 1.60/1.13
% 1.60/1.13 % ------
% 1.60/1.13 % Current options:
% 1.60/1.13 % ------
% 1.60/1.13
% 1.60/1.13
% 1.60/1.13 %
% 1.60/1.13
% 1.60/1.13 % ------ Proving...
% 1.60/1.13 %
% 1.60/1.13
% 1.60/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 1.60/1.13
% 1.60/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.60/1.13
% 1.60/1.13
%------------------------------------------------------------------------------