%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN162-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 : n008.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:20 PM UTC 2026
% Result : Unsatisfiable 1.15s 1.13s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 66 ( 17 unt; 0 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 170 ( 87 ~; 83 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 23 ( 22 usr; 5 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
fof(f14,axiom,
! [X0] : p0(b,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
fof(f19,axiom,
! [X0,X1] : m0(X0,d,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
fof(f24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
fof(f29,axiom,
q0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_29) ).
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(f106,axiom,
! [X0] :
( ~ k0(X0)
| p1(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_068) ).
fof(f163,axiom,
! [X0] :
( ~ p0(X0,X0)
| s1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
fof(f164,axiom,
! [X2,X0,X1] :
( ~ s1(X2)
| ~ q0(X0,X1)
| s1(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
fof(f171,axiom,
! [X2,X3,X0,X1] :
( ~ m0(X3,X2,X0)
| ~ s1(X2)
| ~ p0(X1,X1)
| l2(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).
fof(f175,axiom,
! [X2,X0,X1] :
( ~ p1(X1,X2,X0)
| n2(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
fof(f221,axiom,
! [X0,X1] :
( ~ l2(X1,X0)
| ~ l0(c)
| ~ k1(X1)
| q2(X0,c,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).
fof(f248,axiom,
! [X0] :
( ~ n2(X0)
| k3(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_210) ).
fof(f274,axiom,
! [X0] :
( ~ n2(X0)
| m3(X0,X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
fof(f296,axiom,
! [X2,X0,X1] :
( ~ l2(X2,X2)
| ~ s1(X1)
| ~ r2(X0)
| q3(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_258) ).
fof(f333,axiom,
! [X2,X3,X0,X1,X4] :
( ~ m3(X3,X4,X3)
| ~ q2(X3,X1,X0)
| ~ k3(X2,X2,X0)
| q4(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_295) ).
fof(f351,axiom,
! [X0,X1] :
( ~ q4(X1,X0)
| n5(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_313) ).
fof(f369,negated_conjecture,
~ n5(c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_424,plain,
n0(d,b),
inference(cnf_transformation,[],[f7]) ).
tcf(c_431,plain,
! [X0: $i] : p0(b,X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_436,plain,
! [X0: $i,X1: $i] : m0(X0,d,X1),
inference(cnf_transformation,[],[f19]) ).
tcf(c_441,plain,
l0(c),
inference(cnf_transformation,[],[f24]) ).
tcf(c_446,plain,
q0(d,b),
inference(cnf_transformation,[],[f29]) ).
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_522,plain,
! [X0: $i] :
( p1(X0,X0,X0)
| ~ k0(X0) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_578,plain,
! [X0: $i] :
( s1(X0)
| ~ p0(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_579,plain,
! [X0: $i,X1: $i,X2: $i] :
( s1(X0)
| ~ s1(X2)
| ~ q0(X0,X1) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_585,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_589,plain,
! [X0: $i,X1: $i,X2: $i] :
( n2(X2)
| ~ p1(X0,X1,X2) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_635,plain,
! [X0: $i,X1: $i] :
( q2(X1,c,X0)
| ~ l0(c)
| ~ k1(X0)
| ~ l2(X0,X1) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_660,plain,
! [X0: $i] :
( k3(X0,X0,X0)
| ~ n2(X0) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_686,plain,
! [X0: $i] :
( m3(X0,X0,X0)
| ~ n2(X0) ),
inference(cnf_transformation,[],[f274]) ).
tcf(c_708,plain,
! [X0: $i,X1: $i,X2: $i] :
( q3(X2,X2)
| ~ r2(X2)
| ~ s1(X1)
| ~ l2(X0,X0) ),
inference(cnf_transformation,[],[f296]) ).
tcf(c_743,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( q4(X2,X1)
| ~ m3(X0,X4,X0)
| ~ k3(X3,X3,X2)
| ~ q2(X0,X1,X2) ),
inference(cnf_transformation,[],[f333]) ).
tcf(c_757,plain,
! [X0: $i,X1: $i] :
( n5(X1,X1)
| ~ q4(X0,X1) ),
inference(cnf_transformation,[],[f351]) ).
tcf(c_768,negated_conjecture,
~ n5(c,c),
inference(cnf_transformation,[],[f369]) ).
tcf(c_770,plain,
p0(b,b),
inference(instantiation,[status(thm)],[c_431]) ).
tcf(c_771,plain,
m0(b,d,b),
inference(instantiation,[status(thm)],[c_436]) ).
tcf(c_775,plain,
( s1(b)
| ~ p0(b,b) ),
inference(instantiation,[status(thm)],[c_578]) ).
tcf(c_784,plain,
( m3(b,b,b)
| ~ n2(b) ),
inference(instantiation,[status(thm)],[c_686]) ).
tcf(c_786,plain,
( k3(b,b,b)
| ~ n2(b) ),
inference(instantiation,[status(thm)],[c_660]) ).
tcf(c_788,plain,
( n2(b)
| ~ p1(b,b,b) ),
inference(instantiation,[status(thm)],[c_589]) ).
tcf(c_790,plain,
( p1(b,b,b)
| ~ k0(b) ),
inference(instantiation,[status(thm)],[c_522]) ).
tcf(c_1024,plain,
! [X0: $i,X1: $i] :
( q2(X1,c,X0)
| ~ l2(X0,X1)
| ~ k1(X0) ),
inference(global_subsumption_just,[status(thm)],[c_635,c_441,c_635]) ).
tcf(c_1025,plain,
! [X0: $i,X1: $i] :
( q2(X1,c,X0)
| ~ k1(X0)
| ~ l2(X0,X1) ),
inference(renaming,[status(thm)],[c_1024]) ).
tcf(c_1026,plain,
( q2(b,c,b)
| ~ k1(b)
| ~ l2(b,b) ),
inference(instantiation,[status(thm)],[c_1025]) ).
tcf(c_1098,plain,
! [X0: $i] :
( ~ iPr_def_35
| ~ s1(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_35])],[c_708]) ).
tcf(c_1165,plain,
! [X0: $i] :
( ~ iPr_def_79
| ~ p0(X0,X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_79])],[c_585]) ).
tcf(c_1166,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_80
| ~ s1(X1)
| l2(X2,X2)
| ~ m0(X0,X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_80])],[c_585]) ).
tcf(c_1167,plain,
( iPr_def_80
| iPr_def_79 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_585]) ).
tcf(c_1168,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_81
| s1(X0)
| ~ q0(X0,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_81])],[c_579]) ).
tcf(c_1169,plain,
( iPr_def_81
| iPr_def_35 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_579]) ).
tcf(c_1216,plain,
( ~ iPr_def_35
| ~ s1(b) ),
inference(instantiation,[status(thm)],[c_1098]) ).
tcf(c_1231,plain,
( ~ iPr_def_79
| ~ p0(b,b) ),
inference(instantiation,[status(thm)],[c_1165]) ).
tcf(c_1295,plain,
! [X0: $i] :
( n5(c,c)
| ~ q4(X0,c) ),
inference(instantiation,[status(thm)],[c_757]) ).
tcf(c_1296,plain,
( n5(c,c)
| ~ q4(b,c) ),
inference(instantiation,[status(thm)],[c_1295]) ).
tcf(c_1309,plain,
( k1(b)
| ~ n0(d,b) ),
inference(instantiation,[status(thm)],[c_456]) ).
tcf(c_1338,plain,
! [X0: $i] :
( s1(d)
| ~ iPr_def_81
| ~ q0(d,X0) ),
inference(instantiation,[status(thm)],[c_1168]) ).
tcf(c_1339,plain,
( s1(d)
| ~ iPr_def_81
| ~ q0(d,b) ),
inference(instantiation,[status(thm)],[c_1338]) ).
tcf(c_1538,plain,
! [X0: $i,X1: $i] :
( l2(X1,X1)
| ~ iPr_def_80
| ~ s1(d)
| ~ m0(X0,d,X1) ),
inference(instantiation,[status(thm)],[c_1166]) ).
tcf(c_1539,plain,
( l2(b,b)
| ~ iPr_def_80
| ~ s1(d)
| ~ m0(b,d,b) ),
inference(instantiation,[status(thm)],[c_1538]) ).
tcf(c_1748,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( q4(X1,c)
| ~ q2(X2,c,X1)
| ~ m3(X2,X3,X2)
| ~ k3(X0,X0,X1) ),
inference(instantiation,[status(thm)],[c_743]) ).
tcf(c_1749,plain,
( q4(b,c)
| ~ m3(b,b,b)
| ~ k3(b,b,b)
| ~ q2(b,c,b) ),
inference(instantiation,[status(thm)],[c_1748]) ).
tcf(c_1750,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1749,c_1539,c_1339,c_1309,c_1296,c_1231,c_1216,c_1169,c_1167,c_1026,c_790,c_788,c_786,c_784,c_775,c_771,c_768,c_424,c_770,c_446,c_449]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN162-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 00:22:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running EPR theorem proving
% 0.10/0.41 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.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...
% 1.15/1.13 % SZS status Started for theBenchmark.p
% 1.15/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 1.15/1.13
% 1.15/1.13 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/1.13
% 1.15/1.13 % ------ iProver source info
% 1.15/1.13
% 1.15/1.13 % git: date: 2026-07-19 20:42:38 +0200
% 1.15/1.13 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/1.13 % git: non_committed_changes: false
% 1.15/1.13
% 1.15/1.13 % ------ Parsing...% successful
% 1.15/1.13
% 1.15/1.13
% 1.15/1.13 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.15/1.13 %
% 1.15/1.13
% 1.15/1.13 % ------ Preprocessing... sf_s rm: 21 0s sf_e sf_s rm: 0 0s sf_e %
% 1.15/1.13
% 1.15/1.13 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.15/1.13 gs_s sp: 112 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.15/1.13 % ------ Proving...
% 1.15/1.13 % ------ Problem Properties
% 1.15/1.13
% 1.15/1.13 %
% 1.15/1.13 % clauses 408
% 1.15/1.13 % conjectures 1
% 1.15/1.13 % EPR 408
% 1.15/1.13 % Horn 353
% 1.15/1.13 % unary 52
% 1.15/1.13 % binary 165
% 1.15/1.13 % lits 1025
% 1.15/1.13 % lits eq 0
% 1.15/1.13 % fd_pure 0
% 1.15/1.13 % fd_pseudo 0
% 1.15/1.13 % fd_cond 0
% 1.15/1.13 % fd_pseudo_cond 0
% 1.15/1.13 % AC symbols 0
% 1.15/1.13
% 1.15/1.13 % ------ Schedule EPR non Horn non eq is on
% 1.15/1.13
% 1.15/1.13 % ------ no equalities: superposition off
% 1.15/1.13
% 1.15/1.13 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.15/1.13
% 1.15/1.13
% 1.15/1.13 % ------
% 1.15/1.13 % Current options:
% 1.15/1.13 % ------
% 1.15/1.13
% 1.15/1.13
% 1.15/1.13 %
% 1.15/1.13
% 1.15/1.13 % ------ Proving...
% 1.15/1.13 %
% 1.15/1.13
% 1.15/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 1.15/1.13
% 1.15/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/1.13
% 1.15/1.13
%------------------------------------------------------------------------------