%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR026+3 : TPTP v9.2.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:13:54 PM UTC 2026
% Result : Theorem 6.11s 4.48s
% Output : CNFRefutation 6.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 20 ~; 14 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query126,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query126) ).
fof(ax2_1907,axiom,
! [X2] :
( ( mtvisible(c_tptp_member2701_mt)
& runningshorts(X2) )
=> tptpofobject(X2,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1907) ).
fof(ax2_1317,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1317) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_1645,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1645) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).
fof(ax2_723,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_723) ).
fof(ax2_923,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_923) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query126]) ).
fof(c_0_9,negated_conjecture,
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X6552] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X6552)
| tptpofobject(X6552,f_tptpquantityfn_2(n_756)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1907])]) ).
cnf(c_0_11,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(fof_nnf,[status(thm)],[ax2_1317]) ).
fof(c_0_14,plain,
! [X11948,X11949] :
( ~ mtvisible(X11948)
| ~ genlmt(X11948,X11949)
| mtvisible(X11949) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])]) ).
cnf(c_0_15,negated_conjecture,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax2_1645]) ).
cnf(c_0_19,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
cnf(c_0_21,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_723]) ).
cnf(c_0_22,negated_conjecture,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_24,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(split_conjunct,[status(thm)],[ax2_923]) ).
cnf(c_0_25,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_26,plain,
( mtvisible(c_tptp_spindleheadmt)
| ~ mtvisible(c_tptp_member3993_mt) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_19])]) ).
cnf(c_0_29,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_25,c_0_26,c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : CSR026+3 : TPTP v9.2.1. Released v3.4.0.
% 0.00/0.08 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.07/0.26 % Computer : n024.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon May 4 11:26:12 EDT 2026
% 0.07/0.26 % CPUTime :
% 0.07/0.27 % start to proof: theBenchmark
% 6.11/4.48 % Version : CSE_E---1.7
% 6.11/4.48 % Problem : theBenchmark.p
% 6.11/4.48 % SZS status Theorem for theBenchmark.p
% 6.11/4.48 % SZS output start CNFRefutation
% See solution above
% 6.11/4.49 % Total time : 3.938s
%------------------------------------------------------------------------------