%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR026+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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 01:09:55 PM UTC 2026
% Result : Theorem 1.68s 1.27s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 21 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 32 ~; 26 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just5) ).
fof(f6,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just6) ).
fof(f7,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
fof(f8,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just8) ).
fof(f9,axiom,
! [X0] :
( ( runningshorts(X0)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).
fof(f11,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).
fof(f48,axiom,
! [X0,X1] :
( ( genlmt(X0,X1)
& mtvisible(X0) )
=> mtvisible(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just48) ).
fof(f57,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query26) ).
fof(f58,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f79,plain,
! [X0] :
( ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f80,plain,
! [X0] :
( ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(ennf_transformation,[],[f11]) ).
fof(f102,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f103,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(flattening,[],[f102]) ).
fof(f112,plain,
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(ennf_transformation,[],[f58]) ).
fof(f117,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f5]) ).
fof(f118,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(cnf_transformation,[],[f6]) ).
fof(f119,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f7]) ).
fof(f120,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(cnf_transformation,[],[f8]) ).
fof(f121,plain,
! [X0] :
( ~ runningshorts(X0)
| ~ mtvisible(c_tptp_member2701_mt)
| tptpofobject(X0,f_tptpquantityfn_2(n_756)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f122,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(cnf_transformation,[],[f81]) ).
fof(f140,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f149,plain,
mtvisible(c_tptp_spindlecollectormt),
inference(cnf_transformation,[],[f112]) ).
fof(f150,plain,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(cnf_transformation,[],[f112]) ).
tcf(c_53,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f117]) ).
tcf(c_54,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(cnf_transformation,[],[f118]) ).
tcf(c_55,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f119]) ).
tcf(c_56,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(cnf_transformation,[],[f120]) ).
tcf(c_57,plain,
! [X0: $i] :
( tptpofobject(X0,f_tptpquantityfn_2(n_756))
| ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X0) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_58,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( mtvisible(X1)
| ~ mtvisible(X0)
| ~ genlmt(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_85,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(cnf_transformation,[],[f150]) ).
tcf(c_86,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(cnf_transformation,[],[f149]) ).
tcf(c_106,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_312,plain,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(resolution,[status(thm)],[c_57,c_85]) ).
tcf(c_322,plain,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_cyclistsmt) ),
inference(resolution,[status(thm)],[c_106,c_312]) ).
tcf(c_416,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(demodulation,[status(thm)],[c_86]) ).
tcf(c_421,plain,
! [X0: $i] :
( mtvisible(X0)
| ~ genlmt(c_tptp_spindlecollectormt,X0) ),
inference(resolution,[status(thm)],[c_76,c_416]) ).
tcf(c_423,plain,
mtvisible(c_tptp_member2701_mt),
inference(resolution,[status(thm)],[c_421,c_54]) ).
tcf(c_424,plain,
mtvisible(c_tptp_member3993_mt),
inference(resolution,[status(thm)],[c_421,c_56]) ).
tcf(c_427,plain,
! [X0: $i] :
( mtvisible(X0)
| ~ genlmt(c_tptp_member3993_mt,X0) ),
inference(resolution,[status(thm)],[c_424,c_76]) ).
tcf(c_429,plain,
mtvisible(c_tptp_spindleheadmt),
inference(resolution,[status(thm)],[c_427,c_55]) ).
tcf(c_430,plain,
! [X0: $i] :
( mtvisible(X0)
| ~ genlmt(c_tptp_spindleheadmt,X0) ),
inference(resolution,[status(thm)],[c_429,c_76]) ).
tcf(c_431,plain,
( mtvisible(c_cyclistsmt)
| ~ genlmt(c_tptp_spindleheadmt,c_cyclistsmt) ),
inference(instantiation,[status(thm)],[c_430]) ).
tcf(c_432,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_431,c_423,c_322,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR026+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 08:08:47 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.68/1.27 % SZS status Started for theBenchmark.p
% 1.68/1.27 % SZS status Theorem for theBenchmark.p
% 1.68/1.27
% 1.68/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.68/1.27
% 1.68/1.27 % ------ iProver source info
% 1.68/1.27
% 1.68/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.68/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.68/1.27 % git: non_committed_changes: false
% 1.68/1.27
% 1.68/1.27 % ------ Parsing...
% 1.68/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.68/1.27
% 1.68/1.27 % ------ Preprocessing... sf_s rm: 12 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.68/1.27
% 1.68/1.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.68/1.27 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.68/1.27 % ------ Proving...
% 1.68/1.27 % ------ Problem Properties
% 1.68/1.27
% 1.68/1.27 %
% 1.68/1.27 % clauses 16
% 1.68/1.27 % conjectures 1
% 1.68/1.27 % EPR 16
% 1.68/1.27 % Horn 16
% 1.68/1.27 % unary 10
% 1.68/1.27 % binary 4
% 1.68/1.27 % lits 24
% 1.68/1.27 % lits eq 0
% 1.68/1.27 % fd_pure 0
% 1.68/1.27 % fd_pseudo 0
% 1.68/1.27 % fd_cond 0
% 1.68/1.27 % fd_pseudo_cond 0
% 1.68/1.27 % AC symbols 0
% 1.68/1.27
% 1.68/1.27 % ------ Schedule EPR Horn non eq is on
% 1.68/1.27
% 1.68/1.27 % ------ no equalities: superposition off
% 1.68/1.27
% 1.68/1.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.68/1.27
% 1.68/1.27
% 1.68/1.27 % ------
% 1.68/1.27 % Current options:
% 1.68/1.27 % ------
% 1.68/1.27
% 1.68/1.27
% 1.68/1.27 %
% 1.68/1.27
% 1.68/1.27 % ------ Proving...
% 1.68/1.27 %
% 1.68/1.27
% 1.68/1.27 % SZS status Theorem for theBenchmark.p
% 1.68/1.27
% 1.68/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.68/1.27
% 1.68/1.27
%------------------------------------------------------------------------------