TSTP Solution File: CSR026+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR026+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 8.50s 3.81s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 17 unt; 0 nHn; 25 RR)
% Number of literals : 37 ( 0 equ; 17 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 : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2591,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_2591) ).
cnf(i_0_1365,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_1365) ).
cnf(i_0_2209,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_2209) ).
cnf(i_0_4,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_4) ).
cnf(i_0_2592,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_2592) ).
cnf(i_0_585,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_585) ).
cnf(i_0_468,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_468) ).
cnf(i_0_146,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_146) ).
cnf(i_0_606,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6711vj_q/lgb.p',i_0_606) ).
cnf(c_0_2602,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
i_0_2591 ).
cnf(c_0_2603,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
i_0_1365 ).
cnf(c_0_2604,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2209 ).
cnf(c_0_2605,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
i_0_4 ).
cnf(c_0_2606,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_2592 ).
cnf(c_0_2607,negated_conjecture,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(spm,[status(thm)],[c_0_2602,c_0_2603]) ).
cnf(c_0_2608,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
i_0_585 ).
cnf(c_0_2609,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
i_0_468 ).
cnf(c_0_2610,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
i_0_146 ).
cnf(c_0_2611,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2604,c_0_2605]),c_0_2606])]) ).
cnf(c_0_2612,plain,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_2607,c_0_2608]) ).
cnf(c_0_2613,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2604,c_0_2609]),c_0_2606])]) ).
cnf(c_0_2614,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_606 ).
cnf(c_0_2615,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2604,c_0_2610]),c_0_2611])]) ).
cnf(c_0_2616,plain,
~ mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2612,c_0_2613])]) ).
cnf(c_0_2617,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2604,c_0_2614]),c_0_2615])]),c_0_2616]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR026+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 09:04:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.91/1.15 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.15 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.91/1.15 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.91/1.15 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.50/3.81 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.50/3.81 # No SInE strategy applied
% 8.50/3.81 # Trying AutoSched0 for 150 seconds
% 8.50/3.81 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.50/3.81 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.50/3.81 #
% 8.50/3.81 # Preprocessing time : 0.030 s
% 8.50/3.81 # Presaturation interreduction done
% 8.50/3.81
% 8.50/3.81 # Proof found!
% 8.50/3.81 # SZS status Theorem
% 8.50/3.81 # SZS output start CNFRefutation
% See solution above
% 8.50/3.82 # Training examples: 0 positive, 0 negative
% 8.50/3.82
% 8.50/3.82 # -------------------------------------------------
% 8.50/3.82 # User time : 0.065 s
% 8.50/3.82 # System time : 0.008 s
% 8.50/3.82 # Total time : 0.073 s
% 8.50/3.82 # Maximum resident set size: 7128 pages
% 8.50/3.82
%------------------------------------------------------------------------------