TSTP Solution File: CSR070+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR070+4 : 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:47:23 EDT 2022
% Result : Theorem 13.82s 4.46s
% Output : CNFRefutation 13.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 24 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_485,plain,
( tptptypes_6_818(X1,X2)
| ~ tptptypes_7_819(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_485) ).
cnf(i_0_200,plain,
( tptptypes_7_819(X1,X2)
| ~ tptptypes_8_823(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_200) ).
cnf(i_0_2263,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_2263) ).
cnf(i_0_2517,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2668_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_2517) ).
cnf(i_0_2618,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_2618) ).
cnf(i_0_2617,negated_conjecture,
~ tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_2617) ).
cnf(i_0_1043,plain,
( tptptypes_5_802(X1,X2)
| ~ tptptypes_6_818(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_1043) ).
cnf(i_0_696,plain,
( tptptypes_8_823(X1,X2)
| ~ tptptypes_9_824(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_696) ).
cnf(i_0_652,plain,
( tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)
| ~ mtvisible(c_tptp_member2668_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f3_kj21x/input.p',i_0_652) ).
cnf(c_0_2628,plain,
( tptptypes_6_818(X1,X2)
| ~ tptptypes_7_819(X1,X2) ),
i_0_485 ).
cnf(c_0_2629,plain,
( tptptypes_7_819(X1,X2)
| ~ tptptypes_8_823(X1,X2) ),
i_0_200 ).
cnf(c_0_2630,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2263 ).
cnf(c_0_2631,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2668_mt),
i_0_2517 ).
cnf(c_0_2632,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_2618 ).
cnf(c_0_2633,negated_conjecture,
~ tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
i_0_2617 ).
cnf(c_0_2634,plain,
( tptptypes_5_802(X1,X2)
| ~ tptptypes_6_818(X1,X2) ),
i_0_1043 ).
cnf(c_0_2635,plain,
( tptptypes_6_818(X1,X2)
| ~ tptptypes_8_823(X1,X2) ),
inference(spm,[status(thm)],[c_0_2628,c_0_2629]) ).
cnf(c_0_2636,plain,
( tptptypes_8_823(X1,X2)
| ~ tptptypes_9_824(X1,X2) ),
i_0_696 ).
cnf(c_0_2637,plain,
( tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)
| ~ mtvisible(c_tptp_member2668_mt) ),
i_0_652 ).
cnf(c_0_2638,plain,
mtvisible(c_tptp_member2668_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2630,c_0_2631]),c_0_2632])]) ).
cnf(c_0_2639,negated_conjecture,
~ tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(spm,[status(thm)],[c_0_2633,c_0_2634]) ).
cnf(c_0_2640,plain,
( tptptypes_6_818(X1,X2)
| ~ tptptypes_9_824(X1,X2) ),
inference(spm,[status(thm)],[c_0_2635,c_0_2636]) ).
cnf(c_0_2641,plain,
tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2637,c_0_2638])]) ).
cnf(c_0_2642,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2639,c_0_2640]),c_0_2641])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR070+4 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n020.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 18:28:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.85/1.08 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.85/1.08 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.85/1.08 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.85/1.08 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.82/4.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 13.82/4.46 # Version: 2.1pre011
% 13.82/4.46 # Preprocessing time : 0.088 s
% 13.82/4.46
% 13.82/4.46 # Proof found!
% 13.82/4.46 # SZS status Theorem
% 13.82/4.46 # SZS output start CNFRefutation
% See solution above
% 13.82/4.46 # Proof object total steps : 24
% 13.82/4.46 # Proof object clause steps : 15
% 13.82/4.46 # Proof object formula steps : 9
% 13.82/4.46 # Proof object conjectures : 6
% 13.82/4.46 # Proof object clause conjectures : 4
% 13.82/4.46 # Proof object formula conjectures : 2
% 13.82/4.46 # Proof object initial clauses used : 9
% 13.82/4.46 # Proof object initial formulas used : 9
% 13.82/4.46 # Proof object generating inferences : 5
% 13.82/4.46 # Proof object simplifying inferences : 6
% 13.82/4.46 # Training examples: 0 positive, 0 negative
% 13.82/4.46 # Parsed axioms : 2617
% 13.82/4.46 # Removed by relevancy pruning/SinE : 0
% 13.82/4.46 # Initial clauses : 2617
% 13.82/4.46 # Removed in clause preprocessing : 0
% 13.82/4.46 # Initial clauses in saturation : 2617
% 13.82/4.46 # Processed clauses : 4474
% 13.82/4.46 # ...of these trivial : 588
% 13.82/4.46 # ...subsumed : 172
% 13.82/4.46 # ...remaining for further processing : 3714
% 13.82/4.46 # Other redundant clauses eliminated : 2
% 13.82/4.46 # Clauses deleted for lack of memory : 0
% 13.82/4.46 # Backward-subsumed : 5
% 13.82/4.46 # Backward-rewritten : 95
% 13.82/4.46 # Generated clauses : 7245
% 13.82/4.46 # ...of the previous two non-trivial : 6109
% 13.82/4.46 # Contextual simplify-reflections : 5
% 13.82/4.46 # Paramodulations : 7243
% 13.82/4.46 # Factorizations : 0
% 13.82/4.46 # Equation resolutions : 2
% 13.82/4.46 # Propositional unsat checks : 0
% 13.82/4.46 # Propositional unsat check successes : 0
% 13.82/4.46 # Current number of processed clauses : 3612
% 13.82/4.46 # Positive orientable unit clauses : 1737
% 13.82/4.46 # Positive unorientable unit clauses: 0
% 13.82/4.46 # Negative unit clauses : 569
% 13.82/4.46 # Non-unit-clauses : 1306
% 13.82/4.46 # Current number of unprocessed clauses: 4052
% 13.82/4.46 # ...number of literals in the above : 7168
% 13.82/4.46 # Current number of archived formulas : 0
% 13.82/4.46 # Current number of archived clauses : 100
% 13.82/4.46 # Clause-clause subsumption calls (NU) : 229928
% 13.82/4.46 # Rec. Clause-clause subsumption calls : 210267
% 13.82/4.46 # Non-unit clause-clause subsumptions : 93
% 13.82/4.46 # Unit Clause-clause subsumption calls : 453396
% 13.82/4.46 # Rewrite failures with RHS unbound : 0
% 13.82/4.46 # BW rewrite match attempts : 2571
% 13.82/4.46 # BW rewrite match successes : 27
% 13.82/4.46 # Condensation attempts : 0
% 13.82/4.46 # Condensation successes : 0
% 13.82/4.46 # Termbank termtop insertions : 107193
% 13.82/4.46
% 13.82/4.46 # -------------------------------------------------
% 13.82/4.46 # User time : 0.420 s
% 13.82/4.46 # System time : 0.017 s
% 13.82/4.46 # Total time : 0.437 s
% 13.82/4.46 # ...preprocessing : 0.088 s
% 13.82/4.46 # ...main loop : 0.349 s
% 13.82/4.46 # Maximum resident set size: 24628 pages
% 13.82/4.46
%------------------------------------------------------------------------------