%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN262-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 : n006.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.75s 1.10s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 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 : 8 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 25 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
fof(f20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
fof(f26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
fof(f32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
fof(f101,axiom,
! [X0,X1] :
( ~ k0(X1)
| ~ n0(d,X0)
| p1(X0,X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_063) ).
fof(f109,axiom,
! [X2,X3,X0,X1] :
( ~ s0(b)
| ~ p1(X1,X3,X0)
| ~ l0(X2)
| p1(X0,X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_071) ).
fof(f369,negated_conjecture,
~ p1(b,c,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_418,negated_conjecture,
~ p1(b,c,b),
inference(cnf_transformation,[],[f369]) ).
tcf(c_549,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p1(X2,X0,X2)
| ~ s0(b)
| ~ l0(X3)
| ~ p1(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_554,plain,
s0(b),
inference(cnf_transformation,[],[f5]) ).
tcf(c_585,plain,
l0(a),
inference(cnf_transformation,[],[f20]) ).
tcf(c_589,plain,
! [X0: $i,X1: $i] :
( p1(X0,X0,X1)
| ~ k0(X1)
| ~ n0(d,X0) ),
inference(cnf_transformation,[],[f101]) ).
tcf(c_596,plain,
n0(d,c),
inference(cnf_transformation,[],[f26]) ).
tcf(c_613,plain,
k0(b),
inference(cnf_transformation,[],[f32]) ).
tcf(c_941,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p1(X2,X0,X2)
| ~ p1(X0,X1,X2)
| ~ l0(X3) ),
inference(global_subsumption_just,[status(thm)],[c_549,c_554,c_549]) ).
tcf(c_942,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p1(X2,X0,X2)
| ~ l0(X3)
| ~ p1(X0,X1,X2) ),
inference(renaming,[status(thm)],[c_941]) ).
tcf(c_963,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ l0(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_942]) ).
tcf(c_964,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_11
| p1(X2,X0,X2)
| ~ p1(X0,X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_942]) ).
tcf(c_965,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_942]) ).
tcf(c_1038,plain,
( ~ iPr_def_10
| ~ l0(a) ),
inference(instantiation,[status(thm)],[c_963]) ).
tcf(c_1113,plain,
! [X0: $i] :
( p1(b,c,b)
| ~ iPr_def_11
| ~ p1(c,X0,b) ),
inference(instantiation,[status(thm)],[c_964]) ).
tcf(c_1135,plain,
( p1(b,c,b)
| ~ iPr_def_11
| ~ p1(c,c,b) ),
inference(instantiation,[status(thm)],[c_1113]) ).
tcf(c_1136,plain,
( p1(c,c,b)
| ~ k0(b)
| ~ n0(d,c) ),
inference(instantiation,[status(thm)],[c_589]) ).
tcf(c_1137,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1136,c_1135,c_1038,c_965,c_418,c_596,c_585,c_613]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN262-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n006.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:39:41 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running EPR theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.75/1.10 % SZS status Started for theBenchmark.p
% 1.75/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.75/1.10
% 1.75/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.75/1.10
% 1.75/1.10 % ------ iProver source info
% 1.75/1.10
% 1.75/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 1.75/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.75/1.10 % git: non_committed_changes: false
% 1.75/1.10
% 1.75/1.10 % ------ Parsing...% successful
% 1.75/1.10
% 1.75/1.10
% 1.75/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.75/1.10 %
% 1.75/1.10
% 1.75/1.10 % ------ Preprocessing... sf_s rm: 167 0s sf_e sf_s rm: 0 0s sf_e %
% 1.75/1.10
% 1.75/1.10 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.75/1.10 gs_s sp: 28 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.10 % ------ Proving...
% 1.75/1.10 % ------ Problem Properties
% 1.75/1.10
% 1.75/1.10 %
% 1.75/1.10 % clauses 134
% 1.75/1.10 % conjectures 1
% 1.75/1.10 % EPR 134
% 1.75/1.10 % Horn 120
% 1.75/1.10 % unary 48
% 1.75/1.10 % binary 40
% 1.75/1.10 % lits 280
% 1.75/1.10 % lits eq 0
% 1.75/1.10 % fd_pure 0
% 1.75/1.10 % fd_pseudo 0
% 1.75/1.10 % fd_cond 0
% 1.75/1.10 % fd_pseudo_cond 0
% 1.75/1.10 % AC symbols 0
% 1.75/1.10
% 1.75/1.10 % ------ Schedule EPR non Horn non eq is on
% 1.75/1.10
% 1.75/1.10 % ------ no equalities: superposition off
% 1.75/1.10
% 1.75/1.10 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.75/1.10
% 1.75/1.10
% 1.75/1.10 % ------
% 1.75/1.10 % Current options:
% 1.75/1.10 % ------
% 1.75/1.10
% 1.75/1.10
% 1.75/1.10 %
% 1.75/1.10
% 1.75/1.10 % ------ Proving...
% 1.75/1.10 %
% 1.75/1.10
% 1.75/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.75/1.10
% 1.75/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.10
% 1.75/1.10
%------------------------------------------------------------------------------