TSTP Solution File: CSR048+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR048+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:47:00 EDT 2022
% Result : Theorem 9.23s 3.31s
% Output : CNFRefutation 9.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_428,plain,
( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n629vta1/lgb.p',i_0_428) ).
cnf(i_0_2532,negated_conjecture,
~ borderson(c_georegion_l4_x45_y9,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n629vta1/lgb.p',i_0_2532) ).
cnf(i_0_2429,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n629vta1/lgb.p',i_0_2429) ).
cnf(i_0_756,plain,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n629vta1/lgb.p',i_0_756) ).
cnf(i_0_2533,negated_conjecture,
mtvisible(c_tptpgeo_spindlecollectormt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n629vta1/lgb.p',i_0_2533) ).
cnf(c_0_2539,plain,
( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
i_0_428 ).
cnf(c_0_2540,negated_conjecture,
~ borderson(c_georegion_l4_x45_y9,X1),
i_0_2532 ).
cnf(c_0_2541,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2429 ).
cnf(c_0_2542,plain,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
i_0_756 ).
cnf(c_0_2543,negated_conjecture,
mtvisible(c_tptpgeo_spindlecollectormt),
i_0_2533 ).
cnf(c_0_2544,plain,
~ mtvisible(c_tptpgeo_member1_mt),
inference(sr,[status(thm)],[c_0_2539,c_0_2540]) ).
cnf(c_0_2545,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2541,c_0_2542]),c_0_2543])]),c_0_2544]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR048+3 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Fri Jun 10 07:09:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.58 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.23/3.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.23/3.31 # No SInE strategy applied
% 9.23/3.31 # Trying AutoSched0 for 150 seconds
% 9.23/3.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.23/3.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.23/3.31 #
% 9.23/3.31 # Preprocessing time : 0.020 s
% 9.23/3.31 # Presaturation interreduction done
% 9.23/3.31
% 9.23/3.31 # Proof found!
% 9.23/3.31 # SZS status Theorem
% 9.23/3.31 # SZS output start CNFRefutation
% See solution above
% 9.23/3.31 # Training examples: 0 positive, 0 negative
% 9.23/3.31
% 9.23/3.31 # -------------------------------------------------
% 9.23/3.31 # User time : 0.046 s
% 9.23/3.31 # System time : 0.010 s
% 9.23/3.31 # Total time : 0.056 s
% 9.23/3.31 # Maximum resident set size: 7124 pages
% 9.23/3.31
%------------------------------------------------------------------------------