%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR056+2 : 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 : 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 01:10:17 PM UTC 2026
% Result : Theorem 4.13s 1.30s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 30 ~; 25 |; 3 &)
% ( 0 <=>; 6 =>; 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn 22 !; 2 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f40,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_40) ).
fof(f202,axiom,
! [X0] :
( ( supplies(X0)
& mtvisible(c_tptp_spindleheadmt) )
=> tptpofobject(X0,f_tptpquantityfn_14(n_232)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_202) ).
fof(f238,axiom,
! [X0] :
( artsupplies(X0)
=> supplies(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_238) ).
fof(f254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(f279,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_279) ).
fof(f1123,axiom,
! [X0,X1] :
( ( genlmt(X0,X1)
& mtvisible(X0) )
=> mtvisible(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(f1132,conjecture,
? [X0] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query106) ).
fof(f1133,negated_conjecture,
~ ? [X0] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X0) ),
inference(negated_conjecture,[status(cth)],[f1132]) ).
fof(f1245,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(ennf_transformation,[],[f40]) ).
fof(f1324,plain,
! [X0] :
( ~ supplies(X0)
| ~ mtvisible(c_tptp_spindleheadmt)
| tptpofobject(X0,f_tptpquantityfn_14(n_232)) ),
inference(ennf_transformation,[],[f202]) ).
fof(f1325,plain,
! [X0] :
( ~ supplies(X0)
| ~ mtvisible(c_tptp_spindleheadmt)
| tptpofobject(X0,f_tptpquantityfn_14(n_232)) ),
inference(flattening,[],[f1324]) ).
fof(f1341,plain,
! [X0] :
( ~ artsupplies(X0)
| supplies(X0) ),
inference(ennf_transformation,[],[f238]) ).
fof(f2012,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(ennf_transformation,[],[f1123]) ).
fof(f2013,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(flattening,[],[f2012]) ).
fof(f2022,plain,
! [X0] :
( mtvisible(c_tptp_member3717_mt)
& ~ tptpofobject(c_tptpartsupplies,X0) ),
inference(ennf_transformation,[],[f1133]) ).
fof(f2062,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(cnf_transformation,[],[f1245]) ).
fof(f2223,plain,
! [X0] :
( ~ supplies(X0)
| ~ mtvisible(c_tptp_spindleheadmt)
| tptpofobject(X0,f_tptpquantityfn_14(n_232)) ),
inference(cnf_transformation,[],[f1325]) ).
fof(f2259,plain,
! [X0] :
( ~ artsupplies(X0)
| supplies(X0) ),
inference(cnf_transformation,[],[f1341]) ).
fof(f2275,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f254]) ).
fof(f2300,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f279]) ).
fof(f3053,plain,
! [X0,X1] :
( ~ genlmt(X0,X1)
| ~ mtvisible(X0)
| mtvisible(X1) ),
inference(cnf_transformation,[],[f2013]) ).
fof(f3062,plain,
mtvisible(c_tptp_member3717_mt),
inference(cnf_transformation,[],[f2022]) ).
fof(f3063,plain,
! [X0] : ~ tptpofobject(c_tptpartsupplies,X0),
inference(cnf_transformation,[],[f2022]) ).
tcf(c_88,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(cnf_transformation,[],[f2062]) ).
tcf(c_249,plain,
! [X0: $i] :
( tptpofobject(X0,f_tptpquantityfn_14(n_232))
| ~ mtvisible(c_tptp_spindleheadmt)
| ~ supplies(X0) ),
inference(cnf_transformation,[],[f2223]) ).
tcf(c_285,plain,
! [X0: $i] :
( supplies(X0)
| ~ artsupplies(X0) ),
inference(cnf_transformation,[],[f2259]) ).
tcf(c_301,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(cnf_transformation,[],[f2275]) ).
tcf(c_326,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(cnf_transformation,[],[f2300]) ).
tcf(c_1079,plain,
! [X0: $i,X1: $i] :
( mtvisible(X1)
| ~ mtvisible(X0)
| ~ genlmt(X0,X1) ),
inference(cnf_transformation,[],[f3053]) ).
tcf(c_1088,negated_conjecture,
! [X0: $i] : ~ tptpofobject(c_tptpartsupplies,X0),
inference(cnf_transformation,[],[f3063]) ).
tcf(c_1089,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(cnf_transformation,[],[f3062]) ).
tcf(c_1403,plain,
( ~ supplies(c_tptpartsupplies)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(superposition,[status(thm)],[c_249,c_1088]) ).
tcf(c_1696,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(superposition,[status(thm)],[c_301,c_1079]) ).
tcf(c_1697,plain,
( mtvisible(c_tptp_spindleheadmt)
| ~ mtvisible(c_tptp_member3717_mt) ),
inference(superposition,[status(thm)],[c_326,c_1079]) ).
tcf(c_1850,plain,
artsupplies(c_tptpartsupplies),
inference(global_subsumption_just,[status(thm)],[c_88,c_1089,c_88,c_1697,c_1696]) ).
tcf(c_1852,plain,
supplies(c_tptpartsupplies),
inference(superposition,[status(thm)],[c_1850,c_285]) ).
tcf(c_1853,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1852,c_1697,c_1403,c_1089]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR056+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n006.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 08:40:40 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 first-order theorem proving
% 0.10/0.41 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 4.13/1.30 % SZS status Started for theBenchmark.p
% 4.13/1.30 % SZS status Theorem for theBenchmark.p
% 4.13/1.30
% 4.13/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.13/1.30
% 4.13/1.30 % ------ iProver source info
% 4.13/1.30
% 4.13/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.13/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.13/1.30 % git: non_committed_changes: false
% 4.13/1.30
% 4.13/1.30 % ------ Parsing...
% 4.13/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 % ------ Problem Properties
% 4.13/1.30
% 4.13/1.30 %
% 4.13/1.30 % clauses 1041
% 4.13/1.30 % conjectures 2
% 4.13/1.30 % EPR 980
% 4.13/1.30 % Horn 1041
% 4.13/1.30 % unary 288
% 4.13/1.30 % binary 709
% 4.13/1.30 % lits 1838
% 4.13/1.30 % lits eq 0
% 4.13/1.30 % fd_pure 0
% 4.13/1.30 % fd_pseudo 0
% 4.13/1.30 % fd_cond 0
% 4.13/1.30 % fd_pseudo_cond 0
% 4.13/1.30 % AC symbols 0
% 4.13/1.30
% 4.13/1.30 % ------ Input Options Time Limit: Unbounded
% 4.13/1.30
% 4.13/1.30
% 4.13/1.30 % ------
% 4.13/1.30 % Current options:
% 4.13/1.30 % ------
% 4.13/1.30
% 4.13/1.30
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % ------ Proving...
% 4.13/1.30 %
% 4.13/1.30
% 4.13/1.30 % SZS status Theorem for theBenchmark.p
% 4.13/1.30
% 4.13/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.13/1.30
% 4.13/1.30
%------------------------------------------------------------------------------