%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 : 600s
% DateTime : Fri Jul 15 02:46:36 EDT 2022
% Result : Theorem 7.44s 2.39s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 18 unt; 0 nHn; 26 RR)
% Number of literals : 38 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 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 : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_48) ).
cnf(i_0_8,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_8) ).
cnf(i_0_58,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_58) ).
cnf(i_0_5,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_5) ).
cnf(i_0_7,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_6) ).
cnf(i_0_9,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_11) ).
cnf(i_0_57,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4osfx91/lgb.p',i_0_57) ).
cnf(c_0_68,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_48 ).
cnf(c_0_69,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
i_0_8 ).
cnf(c_0_70,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_58 ).
cnf(c_0_71,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_5 ).
cnf(c_0_72,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
i_0_7 ).
cnf(c_0_73,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_74,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
i_0_6 ).
cnf(c_0_75,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_68,c_0_71]) ).
cnf(c_0_76,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_72]),c_0_73])]) ).
cnf(c_0_77,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
i_0_9 ).
cnf(c_0_78,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_74]),c_0_70])]) ).
cnf(c_0_79,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
i_0_11 ).
cnf(c_0_80,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_81,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
i_0_57 ).
cnf(c_0_82,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_83,plain,
runningshorts(c_tptprunningshorts),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 22:21:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.44/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.44/2.39 # No SInE strategy applied
% 7.44/2.39 # Trying AutoSched0 for 150 seconds
% 7.44/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.44/2.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.44/2.39 #
% 7.44/2.39 # Preprocessing time : 0.023 s
% 7.44/2.39 # Presaturation interreduction done
% 7.44/2.39
% 7.44/2.39 # Proof found!
% 7.44/2.39 # SZS status Theorem
% 7.44/2.39 # SZS output start CNFRefutation
% See solution above
% 7.44/2.39 # Training examples: 0 positive, 0 negative
% 7.44/2.39
% 7.44/2.39 # -------------------------------------------------
% 7.44/2.39 # User time : 0.024 s
% 7.44/2.39 # System time : 0.005 s
% 7.44/2.39 # Total time : 0.029 s
% 7.44/2.39 # Maximum resident set size: 7124 pages
% 7.44/2.39
%------------------------------------------------------------------------------