%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR026+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : Sun Sep 27 07:06:35 AM UTC 2026
% Result : Theorem 1.38s 1.01s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 11 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 10 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax1_163,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('theBenchmark.p',ax1_163) ).
fof(ax1_440,axiom,
! [INS] :
( ( runningshorts(INS)
& mtvisible(c_tptp_member2701_mt) )
=> tptpofobject(INS,f_tptpquantityfn_2(n_756)) ),
file('theBenchmark.p',ax1_440) ).
fof(ax1_1123,axiom,
! [SPECMT,GENLMT] :
( ( genlmt(SPECMT,GENLMT)
& mtvisible(SPECMT) )
=> mtvisible(GENLMT) ),
file('theBenchmark.p',ax1_1123) ).
fof(query76,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('theBenchmark.p',query76) ).
fof(query76_neg,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query76]) ).
fof(ax1_315,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('theBenchmark.p',ax1_315) ).
cnf(c_982,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(clausify,[status(thm)],[ax1_315]) ).
fof(ax1_364,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('theBenchmark.p',ax1_364) ).
cnf(c_1002,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(clausify,[status(thm)],[ax1_364]) ).
cnf(c_1346,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(clausify,[status(thm)],[ax1_163]) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('theBenchmark.p',ax1_254) ).
cnf(c_1403,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(clausify,[status(thm)],[ax1_254]) ).
fof(ax1_344,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('theBenchmark.p',ax1_344) ).
cnf(c_1452,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(clausify,[status(thm)],[ax1_344]) ).
cnf(c_1519,plain,
( tptpofobject(A,f_tptpquantityfn_2(n_756))
| ~ runningshorts(A)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(clausify,[status(thm)],[ax1_440]) ).
cnf(c_1957,plain,
( mtvisible(B)
| ~ genlmt(A,B)
| ~ mtvisible(A) ),
inference(clausify,[status(thm)],[ax1_1123]) ).
cnf(c_1962,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(clausify,[status(thm)],[query76_neg]) ).
cnf(c_1963,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(clausify,[status(thm)],[query76_neg]) ).
cnf(c_2271,negated_conjecture,
( mtvisible(A)
| ~ genlmt(c_tptp_spindlecollectormt,A) ),
inference(resolve,[status(thm)],[c_1957,c_1962]) ).
cnf(c_2098,negated_conjecture,
mtvisible(c_tptp_member3993_mt),
inference(resolve,[status(thm)],[c_2271,c_1002]) ).
cnf(c_2272,plain,
( mtvisible(A)
| ~ genlmt(c_tptp_member3993_mt,A) ),
inference(resolve,[status(thm)],[c_1957,c_2098]) ).
cnf(c_2114,plain,
mtvisible(c_tptp_spindleheadmt),
inference(resolve,[status(thm)],[c_2272,c_982]) ).
cnf(c_2237,plain,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(resolve,[status(thm)],[c_1519,c_1963]) ).
cnf(c_2239,plain,
( ~ mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(resolve,[status(thm)],[c_2237,c_1346]) ).
cnf(c_2273,plain,
( mtvisible(A)
| ~ genlmt(c_tptp_spindleheadmt,A) ),
inference(resolve,[status(thm)],[c_1957,c_2114]) ).
cnf(c_2243,plain,
mtvisible(c_cyclistsmt),
inference(resolve,[status(thm)],[c_2273,c_1403]) ).
cnf(c_2245,plain,
~ mtvisible(c_tptp_member2701_mt),
inference(resolve,[status(thm)],[c_2243,c_2239]) ).
cnf(c_2274,negated_conjecture,
( mtvisible(A)
| ~ genlmt(c_tptp_spindlecollectormt,A) ),
inference(resolve,[status(thm)],[c_1957,c_1962]) ).
cnf(c_2275,negated_conjecture,
~ genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(resolve,[status(thm)],[c_2274,c_2245]) ).
cnf(c_2270,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1452,c_2275]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR026+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.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.37 % DateTime : Sat Sep 26 23:59:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1732144 was started by sandbox2 on n018,
% 0.10/0.37 % Sat Sep 26 23:59:07 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.22/0.52
% 0.22/0.52 % From the command line: assign(max_seconds, 300).
% 0.22/0.52
% 0.22/0.52 % SInE: 738 to sos, 393 to usable, of 1131 axioms (tolerance 2.00, depth 0 fixpoint).
% 1.38/1.01
% 1.38/1.01 % SZS status Theorem for theBenchmark
% 1.38/1.01
% 1.38/1.01 % Proof 1 at 0.36 (+ 0.04) seconds.
% 1.38/1.01 % Length of proof is 20.
% 1.38/1.01 % Level of proof is 6.
% 1.38/1.01 % Maximum clause weight is 108.000.
% 1.38/1.01 % Given clauses 155.
% 1.38/1.01
% 1.38/1.01 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------