TSTP Solution File: CSR057+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR057+5 : TPTP v8.1.0. Bugfixed v3.5.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:47:09 EDT 2022
% Result : Theorem 20.40s 11.93s
% Output : CNFRefutation 20.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 35 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2584,negated_conjecture,
~ inregion(X1,c_georegion_l4_x75_y75),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_2584) ).
cnf(i_0_2303,plain,
( inregion(X1,X2)
| ~ geographicalsubregions(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_2303) ).
cnf(i_0_2048,plain,
( geographicalsubregions(X1,X1)
| ~ geographicalregion(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_2048) ).
cnf(i_0_2210,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_2210) ).
cnf(i_0_204,plain,
genlmt(c_tptpgeo_member8_mt,c_tptpgeo_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_204) ).
cnf(i_0_2585,negated_conjecture,
mtvisible(c_tptpgeo_member8_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_2585) ).
cnf(i_0_784,plain,
( geographicalregion(X1)
| ~ geolevel_4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_784) ).
cnf(i_0_1570,plain,
( geolevel_4(c_georegion_l4_x75_y75)
| ~ mtvisible(c_worldgeographymt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_1570) ).
cnf(i_0_1330,plain,
genlmt(c_tptpgeo_spindleheadmt,c_worldgeographymt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kmxwdgd3/input.p',i_0_1330) ).
cnf(c_0_2595,negated_conjecture,
~ inregion(X1,c_georegion_l4_x75_y75),
i_0_2584 ).
cnf(c_0_2596,plain,
( inregion(X1,X2)
| ~ geographicalsubregions(X2,X1) ),
i_0_2303 ).
cnf(c_0_2597,negated_conjecture,
~ geographicalsubregions(c_georegion_l4_x75_y75,X1),
inference(spm,[status(thm)],[c_0_2595,c_0_2596]) ).
cnf(c_0_2598,plain,
( geographicalsubregions(X1,X1)
| ~ geographicalregion(X1) ),
i_0_2048 ).
cnf(c_0_2599,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2210 ).
cnf(c_0_2600,plain,
genlmt(c_tptpgeo_member8_mt,c_tptpgeo_spindleheadmt),
i_0_204 ).
cnf(c_0_2601,negated_conjecture,
mtvisible(c_tptpgeo_member8_mt),
i_0_2585 ).
cnf(c_0_2602,plain,
( geographicalregion(X1)
| ~ geolevel_4(X1) ),
i_0_784 ).
cnf(c_0_2603,plain,
( geolevel_4(c_georegion_l4_x75_y75)
| ~ mtvisible(c_worldgeographymt) ),
i_0_1570 ).
cnf(c_0_2604,plain,
~ geographicalregion(c_georegion_l4_x75_y75),
inference(spm,[status(thm)],[c_0_2597,c_0_2598]) ).
cnf(c_0_2605,plain,
genlmt(c_tptpgeo_spindleheadmt,c_worldgeographymt),
i_0_1330 ).
cnf(c_0_2606,plain,
mtvisible(c_tptpgeo_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2599,c_0_2600]),c_0_2601])]) ).
cnf(c_0_2607,plain,
~ mtvisible(c_worldgeographymt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2602,c_0_2603]),c_0_2604]) ).
cnf(c_0_2608,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2599,c_0_2605]),c_0_2606])]),c_0_2607]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR057+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 05:05:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 8.62/8.85 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.62/8.85 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 8.62/8.85 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 8.62/8.85 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 20.40/11.93 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 20.40/11.93 # Version: 2.1pre011
% 20.40/11.93 # Preprocessing time : 0.087 s
% 20.40/11.93
% 20.40/11.93 # Proof found!
% 20.40/11.93 # SZS status Theorem
% 20.40/11.93 # SZS output start CNFRefutation
% See solution above
% 20.40/11.93 # Proof object total steps : 23
% 20.40/11.93 # Proof object clause steps : 14
% 20.40/11.93 # Proof object formula steps : 9
% 20.40/11.93 # Proof object conjectures : 5
% 20.40/11.93 # Proof object clause conjectures : 3
% 20.40/11.93 # Proof object formula conjectures : 2
% 20.40/11.93 # Proof object initial clauses used : 9
% 20.40/11.93 # Proof object initial formulas used : 9
% 20.40/11.93 # Proof object generating inferences : 5
% 20.40/11.93 # Proof object simplifying inferences : 6
% 20.40/11.93 # Training examples: 0 positive, 0 negative
% 20.40/11.93 # Parsed axioms : 2583
% 20.40/11.93 # Removed by relevancy pruning/SinE : 0
% 20.40/11.93 # Initial clauses : 2583
% 20.40/11.93 # Removed in clause preprocessing : 0
% 20.40/11.93 # Initial clauses in saturation : 2583
% 20.40/11.93 # Processed clauses : 2956
% 20.40/11.93 # ...of these trivial : 277
% 20.40/11.93 # ...subsumed : 91
% 20.40/11.93 # ...remaining for further processing : 2587
% 20.40/11.93 # Other redundant clauses eliminated : 5
% 20.40/11.93 # Clauses deleted for lack of memory : 0
% 20.40/11.93 # Backward-subsumed : 8
% 20.40/11.93 # Backward-rewritten : 75
% 20.40/11.93 # Generated clauses : 3702
% 20.40/11.93 # ...of the previous two non-trivial : 3386
% 20.40/11.93 # Contextual simplify-reflections : 6
% 20.40/11.93 # Paramodulations : 3697
% 20.40/11.93 # Factorizations : 0
% 20.40/11.93 # Equation resolutions : 5
% 20.40/11.93 # Propositional unsat checks : 0
% 20.40/11.93 # Propositional unsat check successes : 0
% 20.40/11.93 # Current number of processed clauses : 2499
% 20.40/11.93 # Positive orientable unit clauses : 1201
% 20.40/11.93 # Positive unorientable unit clauses: 0
% 20.40/11.93 # Negative unit clauses : 139
% 20.40/11.93 # Non-unit-clauses : 1159
% 20.40/11.93 # Current number of unprocessed clauses: 2669
% 20.40/11.93 # ...number of literals in the above : 4662
% 20.40/11.93 # Current number of archived formulas : 0
% 20.40/11.93 # Current number of archived clauses : 83
% 20.40/11.93 # Clause-clause subsumption calls (NU) : 138146
% 20.40/11.93 # Rec. Clause-clause subsumption calls : 114504
% 20.40/11.93 # Non-unit clause-clause subsumptions : 76
% 20.40/11.93 # Unit Clause-clause subsumption calls : 51591
% 20.40/11.93 # Rewrite failures with RHS unbound : 0
% 20.40/11.93 # BW rewrite match attempts : 229
% 20.40/11.93 # BW rewrite match successes : 59
% 20.40/11.93 # Condensation attempts : 0
% 20.40/11.93 # Condensation successes : 0
% 20.40/11.93 # Termbank termtop insertions : 70418
% 20.40/11.93
% 20.40/11.93 # -------------------------------------------------
% 20.40/11.93 # User time : 0.231 s
% 20.40/11.93 # System time : 0.012 s
% 20.40/11.93 # Total time : 0.243 s
% 20.40/11.93 # ...preprocessing : 0.087 s
% 20.40/11.93 # ...main loop : 0.156 s
% 20.40/11.93 # Maximum resident set size: 21100 pages
% 20.40/11.93
%------------------------------------------------------------------------------