TSTP Solution File: CSR044+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR044+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:56 EDT 2022
% Result : Theorem 11.13s 4.02s
% Output : CNFRefutation 11.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 12 unt; 0 nHn; 29 RR)
% Number of literals : 52 ( 0 equ; 29 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2513,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_2513) ).
cnf(i_0_1426,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_1426) ).
cnf(i_0_284,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-236l_ns6/input.p',i_0_284) ).
cnf(i_0_2223,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_2223) ).
cnf(i_0_2154,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_2154) ).
cnf(i_0_47,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_47) ).
cnf(i_0_2514,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_2514) ).
cnf(i_0_238,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_238) ).
cnf(i_0_285,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_285) ).
cnf(i_0_484,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_484) ).
cnf(i_0_2107,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-236l_ns6/input.p',i_0_2107) ).
cnf(c_0_2526,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
i_0_2513 ).
cnf(c_0_2527,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
i_0_1426 ).
cnf(c_0_2528,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_2526,c_0_2527]) ).
cnf(c_0_2529,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_284 ).
cnf(c_0_2530,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
i_0_2223 ).
cnf(c_0_2531,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2154 ).
cnf(c_0_2532,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
i_0_47 ).
cnf(c_0_2533,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
i_0_2514 ).
cnf(c_0_2534,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_2528,c_0_2529]),c_0_2530])]) ).
cnf(c_0_2535,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
i_0_238 ).
cnf(c_0_2536,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
i_0_285 ).
cnf(c_0_2537,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_484 ).
cnf(c_0_2538,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2531,c_0_2532]),c_0_2533])]) ).
cnf(c_0_2539,plain,
( ~ isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad)
| ~ mtvisible(c_cyclistsmt) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_2534,c_0_2535]),c_0_2536]) ).
cnf(c_0_2540,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2531,c_0_2537]),c_0_2538])]) ).
cnf(c_0_2541,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
i_0_2107 ).
cnf(c_0_2542,plain,
~ isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2539,c_0_2540])]) ).
cnf(c_0_2543,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2541,c_0_2530]),c_0_2542]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR044+4 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 : Sat Jun 11 02:48:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.86/1.07 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/1.07 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.86/1.07 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.86/1.07 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.13/4.02 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.13/4.02 # Version: 2.1pre011
% 11.13/4.02 # Preprocessing time : 0.070 s
% 11.13/4.02
% 11.13/4.02 # Proof found!
% 11.13/4.02 # SZS status Theorem
% 11.13/4.02 # SZS output start CNFRefutation
% See solution above
% 11.13/4.02 # Proof object total steps : 29
% 11.13/4.02 # Proof object clause steps : 18
% 11.13/4.02 # Proof object formula steps : 11
% 11.13/4.02 # Proof object conjectures : 5
% 11.13/4.02 # Proof object clause conjectures : 3
% 11.13/4.02 # Proof object formula conjectures : 2
% 11.13/4.02 # Proof object initial clauses used : 11
% 11.13/4.02 # Proof object initial formulas used : 11
% 11.13/4.02 # Proof object generating inferences : 6
% 11.13/4.02 # Proof object simplifying inferences : 10
% 11.13/4.02 # Training examples: 0 positive, 0 negative
% 11.13/4.02 # Parsed axioms : 2513
% 11.13/4.02 # Removed by relevancy pruning/SinE : 0
% 11.13/4.02 # Initial clauses : 2513
% 11.13/4.02 # Removed in clause preprocessing : 0
% 11.13/4.02 # Initial clauses in saturation : 2513
% 11.13/4.02 # Processed clauses : 2856
% 11.13/4.02 # ...of these trivial : 163
% 11.13/4.02 # ...subsumed : 114
% 11.13/4.02 # ...remaining for further processing : 2578
% 11.13/4.02 # Other redundant clauses eliminated : 2
% 11.13/4.02 # Clauses deleted for lack of memory : 0
% 11.13/4.02 # Backward-subsumed : 6
% 11.13/4.02 # Backward-rewritten : 119
% 11.13/4.02 # Generated clauses : 5562
% 11.13/4.02 # ...of the previous two non-trivial : 4756
% 11.13/4.02 # Contextual simplify-reflections : 5
% 11.13/4.02 # Paramodulations : 5560
% 11.13/4.02 # Factorizations : 0
% 11.13/4.02 # Equation resolutions : 2
% 11.13/4.02 # Propositional unsat checks : 0
% 11.13/4.02 # Propositional unsat check successes : 0
% 11.13/4.02 # Current number of processed clauses : 2451
% 11.13/4.02 # Positive orientable unit clauses : 1362
% 11.13/4.02 # Positive unorientable unit clauses: 0
% 11.13/4.02 # Negative unit clauses : 79
% 11.13/4.02 # Non-unit-clauses : 1010
% 11.13/4.02 # Current number of unprocessed clauses: 4241
% 11.13/4.02 # ...number of literals in the above : 7175
% 11.13/4.02 # Current number of archived formulas : 0
% 11.13/4.02 # Current number of archived clauses : 125
% 11.13/4.02 # Clause-clause subsumption calls (NU) : 162716
% 11.13/4.02 # Rec. Clause-clause subsumption calls : 153562
% 11.13/4.02 # Non-unit clause-clause subsumptions : 119
% 11.13/4.02 # Unit Clause-clause subsumption calls : 50220
% 11.13/4.02 # Rewrite failures with RHS unbound : 0
% 11.13/4.02 # BW rewrite match attempts : 2018
% 11.13/4.02 # BW rewrite match successes : 21
% 11.13/4.02 # Condensation attempts : 0
% 11.13/4.02 # Condensation successes : 0
% 11.13/4.02 # Termbank termtop insertions : 90355
% 11.13/4.02
% 11.13/4.02 # -------------------------------------------------
% 11.13/4.02 # User time : 0.216 s
% 11.13/4.02 # System time : 0.012 s
% 11.13/4.02 # Total time : 0.228 s
% 11.13/4.02 # ...preprocessing : 0.070 s
% 11.13/4.02 # ...main loop : 0.158 s
% 11.13/4.02 # Maximum resident set size: 21124 pages
% 11.13/4.02
%------------------------------------------------------------------------------