TSTP Solution File: CSR037+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR037+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Fri Jul 15 02:46:48 EDT 2022
% Result : Theorem 7.69s 2.39s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 7 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lw78ntox/input.p',i_0_13) ).
cnf(i_0_67,negated_conjecture,
mtvisible(c_tptpgeo_member7_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lw78ntox/input.p',i_0_67) ).
cnf(i_0_34,plain,
( geographicalsubregions(X1,X2)
| ~ geographicalsubregions(X3,X2)
| ~ geographicalsubregions(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lw78ntox/input.p',i_0_34) ).
cnf(i_0_12,plain,
( geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lw78ntox/input.p',i_0_12) ).
cnf(i_0_66,negated_conjecture,
~ geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lw78ntox/input.p',i_0_66) ).
cnf(c_0_73,plain,
( geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
i_0_13 ).
cnf(c_0_74,negated_conjecture,
mtvisible(c_tptpgeo_member7_mt),
i_0_67 ).
cnf(c_0_75,plain,
( geographicalsubregions(X1,X2)
| ~ geographicalsubregions(X3,X2)
| ~ geographicalsubregions(X1,X3) ),
i_0_34 ).
cnf(c_0_76,plain,
geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_77,plain,
( geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
i_0_12 ).
cnf(c_0_78,plain,
( geographicalsubregions(X1,c_georegion_l4_x45_y72)
| ~ geographicalsubregions(X1,c_georegion_l3_x15_y24) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,plain,
geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_74])]) ).
cnf(c_0_80,negated_conjecture,
~ geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72),
i_0_66 ).
cnf(c_0_81,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR037+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Sat Jun 11 05:42:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.69/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.69/2.39 # No SInE strategy applied
% 7.69/2.39 # Trying AutoSched0 for 150 seconds
% 7.69/2.39 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.69/2.39 # and selection function SelectNewComplexAHP.
% 7.69/2.39 #
% 7.69/2.39 # Preprocessing time : 0.025 s
% 7.69/2.39
% 7.69/2.39 # Proof found!
% 7.69/2.39 # SZS status Theorem
% 7.69/2.39 # SZS output start CNFRefutation
% See solution above
% 7.69/2.39 # Training examples: 0 positive, 0 negative
% 7.69/2.39
% 7.69/2.39 # -------------------------------------------------
% 7.69/2.39 # User time : 0.025 s
% 7.69/2.39 # System time : 0.009 s
% 7.69/2.39 # Total time : 0.034 s
% 7.69/2.39 # Maximum resident set size: 7120 pages
% 7.69/2.39
%------------------------------------------------------------------------------