%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR044+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:55 EDT 2022
% Result : Theorem 14.61s 3.58s
% Output : CNFRefutation 14.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 14 unt; 0 nHn; 31 RR)
% Number of literals : 54 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_129,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_129) ).
cnf(i_0_279,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_279) ).
cnf(i_0_1066,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_1066) ).
cnf(i_0_1065,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_1065) ).
cnf(i_0_833,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_833) ).
cnf(i_0_289,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_289) ).
cnf(i_0_195,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X1)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_195) ).
cnf(i_0_1013,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_1013) ).
cnf(i_0_196,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_196) ).
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-wkgsg4r_/input.p',i_0_336) ).
cnf(i_0_982,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wkgsg4r_/input.p',i_0_982) ).
cnf(c_0_1078,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_129 ).
cnf(c_0_1079,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
i_0_279 ).
cnf(c_0_1080,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
i_0_1066 ).
cnf(c_0_1081,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
i_0_1065 ).
cnf(c_0_1082,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
i_0_833 ).
cnf(c_0_1083,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_289 ).
cnf(c_0_1084,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1078,c_0_1079]),c_0_1080])]) ).
cnf(c_0_1085,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_1081,c_0_1082]) ).
cnf(c_0_1086,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X1)
| ~ mtvisible(c_cyclistsmt) ),
i_0_195 ).
cnf(c_0_1087,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
i_0_1013 ).
cnf(c_0_1088,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
i_0_196 ).
cnf(c_0_1089,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1078,c_0_1083]),c_0_1084])]) ).
cnf(c_0_1090,plain,
( ~ isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1085,c_0_1086]),c_0_1087])]) ).
cnf(c_0_1091,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
i_0_336 ).
cnf(c_0_1092,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1088,c_0_1089])]) ).
cnf(c_0_1093,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
i_0_982 ).
cnf(c_0_1094,plain,
~ isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1090,c_0_1089])]) ).
cnf(c_0_1095,plain,
( isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)
| ~ isa(X1,c_executionbyfiringsquad) ),
inference(spm,[status(thm)],[c_0_1091,c_0_1092]) ).
cnf(c_0_1096,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(spm,[status(thm)],[c_0_1093,c_0_1087]) ).
cnf(c_0_1097,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1094,c_0_1095]),c_0_1096])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR044+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 20:20:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.61/3.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 14.61/3.58 # Version: 2.1pre011
% 14.61/3.58 # Preprocessing time : 0.036 s
% 14.61/3.58
% 14.61/3.58 # Proof found!
% 14.61/3.58 # SZS status Theorem
% 14.61/3.58 # SZS output start CNFRefutation
% See solution above
% 14.61/3.58 # Proof object total steps : 31
% 14.61/3.58 # Proof object clause steps : 20
% 14.61/3.58 # Proof object formula steps : 11
% 14.61/3.58 # Proof object conjectures : 5
% 14.61/3.58 # Proof object clause conjectures : 3
% 14.61/3.58 # Proof object formula conjectures : 2
% 14.61/3.58 # Proof object initial clauses used : 11
% 14.61/3.58 # Proof object initial formulas used : 11
% 14.61/3.58 # Proof object generating inferences : 7
% 14.61/3.58 # Proof object simplifying inferences : 12
% 14.61/3.58 # Training examples: 0 positive, 0 negative
% 14.61/3.58 # Parsed axioms : 1066
% 14.61/3.58 # Removed by relevancy pruning/SinE : 0
% 14.61/3.58 # Initial clauses : 1066
% 14.61/3.58 # Removed in clause preprocessing : 0
% 14.61/3.58 # Initial clauses in saturation : 1066
% 14.61/3.58 # Processed clauses : 6335
% 14.61/3.58 # ...of these trivial : 404
% 14.61/3.58 # ...subsumed : 833
% 14.61/3.58 # ...remaining for further processing : 5098
% 14.61/3.58 # Other redundant clauses eliminated : 0
% 14.61/3.58 # Clauses deleted for lack of memory : 0
% 14.61/3.58 # Backward-subsumed : 0
% 14.61/3.58 # Backward-rewritten : 57
% 14.61/3.58 # Generated clauses : 12623
% 14.61/3.58 # ...of the previous two non-trivial : 11257
% 14.61/3.58 # Contextual simplify-reflections : 2
% 14.61/3.58 # Paramodulations : 12623
% 14.61/3.58 # Factorizations : 0
% 14.61/3.58 # Equation resolutions : 0
% 14.61/3.58 # Propositional unsat checks : 1
% 14.61/3.58 # Propositional unsat check successes : 0
% 14.61/3.58 # Current number of processed clauses : 5041
% 14.61/3.58 # Positive orientable unit clauses : 1210
% 14.61/3.58 # Positive unorientable unit clauses: 0
% 14.61/3.58 # Negative unit clauses : 1836
% 14.61/3.58 # Non-unit-clauses : 1995
% 14.61/3.58 # Current number of unprocessed clauses: 5964
% 14.61/3.58 # ...number of literals in the above : 9678
% 14.61/3.58 # Current number of archived formulas : 0
% 14.61/3.58 # Current number of archived clauses : 57
% 14.61/3.58 # Clause-clause subsumption calls (NU) : 776574
% 14.61/3.58 # Rec. Clause-clause subsumption calls : 674569
% 14.61/3.58 # Non-unit clause-clause subsumptions : 82
% 14.61/3.58 # Unit Clause-clause subsumption calls : 1781728
% 14.61/3.58 # Rewrite failures with RHS unbound : 0
% 14.61/3.58 # BW rewrite match attempts : 16
% 14.61/3.58 # BW rewrite match successes : 13
% 14.61/3.58 # Condensation attempts : 0
% 14.61/3.58 # Condensation successes : 0
% 14.61/3.58 # Termbank termtop insertions : 107774
% 14.61/3.58
% 14.61/3.58 # -------------------------------------------------
% 14.61/3.58 # User time : 0.751 s
% 14.61/3.58 # System time : 0.017 s
% 14.61/3.58 # Total time : 0.768 s
% 14.61/3.58 # ...preprocessing : 0.036 s
% 14.61/3.58 # ...main loop : 0.732 s
% 14.61/3.58 # Maximum resident set size: 22924 pages
% 14.61/3.58
%------------------------------------------------------------------------------