TSTP Solution File: CSR027+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR027+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:37 EDT 2022
% Result : Theorem 12.99s 3.40s
% Output : CNFRefutation 12.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 10 unt; 0 nHn; 25 RR)
% Number of literals : 46 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-4 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_129,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_129) ).
cnf(i_0_242,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_242) ).
cnf(i_0_1066,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_1066) ).
cnf(i_0_1065,negated_conjecture,
( ~ tptpcol_16_31868(X1)
| ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_1065) ).
cnf(i_0_842,plain,
( tptpcol_16_31868(X1)
| ~ isa(X1,c_tptpcol_16_31868) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_842) ).
cnf(i_0_188,plain,
( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
| ~ mtvisible(c_tptp_member2610_mt)
| ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_188) ).
cnf(i_0_189,plain,
( relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)
| ~ mtvisible(c_tptp_member2610_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_189) ).
cnf(i_0_358,plain,
isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_358) ).
cnf(i_0_336,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pe7gi4bn/input.p',i_0_336) ).
cnf(c_0_1076,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_129 ).
cnf(c_0_1077,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt),
i_0_242 ).
cnf(c_0_1078,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_1066 ).
cnf(c_0_1079,negated_conjecture,
( ~ tptpcol_16_31868(X1)
| ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1) ),
i_0_1065 ).
cnf(c_0_1080,plain,
( tptpcol_16_31868(X1)
| ~ isa(X1,c_tptpcol_16_31868) ),
i_0_842 ).
cnf(c_0_1081,plain,
( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
| ~ mtvisible(c_tptp_member2610_mt)
| ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
i_0_188 ).
cnf(c_0_1082,plain,
mtvisible(c_tptp_member2610_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1076,c_0_1077]),c_0_1078])]) ).
cnf(c_0_1083,plain,
( relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)
| ~ mtvisible(c_tptp_member2610_mt) ),
i_0_189 ).
cnf(c_0_1084,negated_conjecture,
( ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1)
| ~ isa(X1,c_tptpcol_16_31868) ),
inference(spm,[status(thm)],[c_0_1079,c_0_1080]) ).
cnf(c_0_1085,plain,
( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
| ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1081,c_0_1082])]) ).
cnf(c_0_1086,plain,
isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),
i_0_358 ).
cnf(c_0_1087,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
i_0_336 ).
cnf(c_0_1088,plain,
relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1083,c_0_1082])]) ).
cnf(c_0_1089,negated_conjecture,
~ isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1084,c_0_1085]),c_0_1086])]) ).
cnf(c_0_1090,plain,
( isa(f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868)
| ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
inference(spm,[status(thm)],[c_0_1087,c_0_1088]) ).
cnf(c_0_1091,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1089,c_0_1090]),c_0_1086])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR027+2 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n028.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 13:04:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.99/3.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 12.99/3.40 # Version: 2.1pre011
% 12.99/3.40 # Preprocessing time : 0.024 s
% 12.99/3.40
% 12.99/3.40 # Proof found!
% 12.99/3.40 # SZS status Theorem
% 12.99/3.40 # SZS output start CNFRefutation
% See solution above
% 12.99/3.40 # Proof object total steps : 25
% 12.99/3.40 # Proof object clause steps : 16
% 12.99/3.40 # Proof object formula steps : 9
% 12.99/3.40 # Proof object conjectures : 7
% 12.99/3.40 # Proof object clause conjectures : 5
% 12.99/3.40 # Proof object formula conjectures : 2
% 12.99/3.40 # Proof object initial clauses used : 9
% 12.99/3.40 # Proof object initial formulas used : 9
% 12.99/3.40 # Proof object generating inferences : 5
% 12.99/3.40 # Proof object simplifying inferences : 10
% 12.99/3.40 # Training examples: 0 positive, 0 negative
% 12.99/3.40 # Parsed axioms : 1066
% 12.99/3.40 # Removed by relevancy pruning/SinE : 0
% 12.99/3.40 # Initial clauses : 1066
% 12.99/3.40 # Removed in clause preprocessing : 0
% 12.99/3.40 # Initial clauses in saturation : 1066
% 12.99/3.40 # Processed clauses : 5220
% 12.99/3.40 # ...of these trivial : 397
% 12.99/3.40 # ...subsumed : 582
% 12.99/3.40 # ...remaining for further processing : 4241
% 12.99/3.40 # Other redundant clauses eliminated : 0
% 12.99/3.40 # Clauses deleted for lack of memory : 0
% 12.99/3.40 # Backward-subsumed : 0
% 12.99/3.40 # Backward-rewritten : 64
% 12.99/3.40 # Generated clauses : 8643
% 12.99/3.40 # ...of the previous two non-trivial : 7920
% 12.99/3.40 # Contextual simplify-reflections : 1
% 12.99/3.40 # Paramodulations : 8643
% 12.99/3.40 # Factorizations : 0
% 12.99/3.40 # Equation resolutions : 0
% 12.99/3.40 # Propositional unsat checks : 0
% 12.99/3.40 # Propositional unsat check successes : 0
% 12.99/3.40 # Current number of processed clauses : 4177
% 12.99/3.40 # Positive orientable unit clauses : 948
% 12.99/3.40 # Positive unorientable unit clauses: 0
% 12.99/3.40 # Negative unit clauses : 1564
% 12.99/3.40 # Non-unit-clauses : 1665
% 12.99/3.40 # Current number of unprocessed clauses: 3713
% 12.99/3.40 # ...number of literals in the above : 5524
% 12.99/3.40 # Current number of archived formulas : 0
% 12.99/3.40 # Current number of archived clauses : 64
% 12.99/3.40 # Clause-clause subsumption calls (NU) : 467928
% 12.99/3.40 # Rec. Clause-clause subsumption calls : 398105
% 12.99/3.40 # Non-unit clause-clause subsumptions : 81
% 12.99/3.40 # Unit Clause-clause subsumption calls : 1225375
% 12.99/3.40 # Rewrite failures with RHS unbound : 0
% 12.99/3.40 # BW rewrite match attempts : 23
% 12.99/3.40 # BW rewrite match successes : 20
% 12.99/3.40 # Condensation attempts : 0
% 12.99/3.40 # Condensation successes : 0
% 12.99/3.40 # Termbank termtop insertions : 74194
% 12.99/3.40
% 12.99/3.40 # -------------------------------------------------
% 12.99/3.40 # User time : 0.486 s
% 12.99/3.40 # System time : 0.011 s
% 12.99/3.40 # Total time : 0.497 s
% 12.99/3.40 # ...preprocessing : 0.024 s
% 12.99/3.40 # ...main loop : 0.474 s
% 12.99/3.40 # Maximum resident set size: 18676 pages
% 12.99/3.40
%------------------------------------------------------------------------------