TSTP Solution File: CSR044+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR044+3 : 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.19s 3.63s
% Output : CNFRefutation 11.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 14 unt; 0 nHn; 31 RR)
% Number of literals : 54 ( 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2398,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_2398) ).
cnf(i_0_163,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_163) ).
cnf(i_0_2515,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_2515) ).
cnf(i_0_1206,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_1206) ).
cnf(i_0_2514,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_2514) ).
cnf(i_0_1577,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_1577) ).
cnf(i_0_560,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-ziezwgne/input.p',i_0_560) ).
cnf(i_0_389,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_389) ).
cnf(i_0_738,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_738) ).
cnf(i_0_561,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_561) ).
cnf(i_0_2353,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ziezwgne/input.p',i_0_2353) ).
cnf(c_0_2527,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2398 ).
cnf(c_0_2528,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
i_0_163 ).
cnf(c_0_2529,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
i_0_2515 ).
cnf(c_0_2530,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_1206 ).
cnf(c_0_2531,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2527,c_0_2528]),c_0_2529])]) ).
cnf(c_0_2532,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
i_0_2514 ).
cnf(c_0_2533,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
i_0_1577 ).
cnf(c_0_2534,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_560 ).
cnf(c_0_2535,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2527,c_0_2530]),c_0_2531])]) ).
cnf(c_0_2536,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_2532,c_0_2533]) ).
cnf(c_0_2537,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2534,c_0_2535])]) ).
cnf(c_0_2538,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
i_0_389 ).
cnf(c_0_2539,negated_conjecture,
~ 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)],[inference(spm,[status(thm)],[c_0_2536,c_0_2537]),c_0_2538])]) ).
cnf(c_0_2540,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ isa(X1,X3)
| ~ relationallexists(X2,X3,X4) ),
i_0_738 ).
cnf(c_0_2541,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
i_0_561 ).
cnf(c_0_2542,plain,
( ~ isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad)
| ~ relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_2539,c_0_2540]) ).
cnf(c_0_2543,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2541,c_0_2535])]) ).
cnf(c_0_2544,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
i_0_2353 ).
cnf(c_0_2545,plain,
~ isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2542,c_0_2543])]) ).
cnf(c_0_2546,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2544,c_0_2538]),c_0_2545]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : CSR044+3 : TPTP v8.1.0. Released v3.4.0.
% 0.14/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 11 05:11:56 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.46/0.64 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.64 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.46/0.64 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.46/0.64 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.19/3.63 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.19/3.63 # Version: 2.1pre011
% 11.19/3.63 # Preprocessing time : 0.045 s
% 11.19/3.63
% 11.19/3.63 # Proof found!
% 11.19/3.63 # SZS status Theorem
% 11.19/3.63 # SZS output start CNFRefutation
% See solution above
% 11.19/3.63 # Proof object total steps : 31
% 11.19/3.63 # Proof object clause steps : 20
% 11.19/3.63 # Proof object formula steps : 11
% 11.19/3.63 # Proof object conjectures : 6
% 11.19/3.63 # Proof object clause conjectures : 4
% 11.19/3.63 # Proof object formula conjectures : 2
% 11.19/3.63 # Proof object initial clauses used : 11
% 11.19/3.63 # Proof object initial formulas used : 11
% 11.19/3.63 # Proof object generating inferences : 6
% 11.19/3.63 # Proof object simplifying inferences : 13
% 11.19/3.63 # Training examples: 0 positive, 0 negative
% 11.19/3.63 # Parsed axioms : 2515
% 11.19/3.63 # Removed by relevancy pruning/SinE : 0
% 11.19/3.63 # Initial clauses : 2515
% 11.19/3.63 # Removed in clause preprocessing : 0
% 11.19/3.63 # Initial clauses in saturation : 2515
% 11.19/3.63 # Processed clauses : 3606
% 11.19/3.63 # ...of these trivial : 463
% 11.19/3.63 # ...subsumed : 200
% 11.19/3.63 # ...remaining for further processing : 2942
% 11.19/3.63 # Other redundant clauses eliminated : 0
% 11.19/3.63 # Clauses deleted for lack of memory : 0
% 11.19/3.63 # Backward-subsumed : 4
% 11.19/3.63 # Backward-rewritten : 116
% 11.19/3.63 # Generated clauses : 6271
% 11.19/3.63 # ...of the previous two non-trivial : 5962
% 11.19/3.63 # Contextual simplify-reflections : 13
% 11.19/3.63 # Paramodulations : 6271
% 11.19/3.63 # Factorizations : 0
% 11.19/3.63 # Equation resolutions : 0
% 11.19/3.63 # Propositional unsat checks : 0
% 11.19/3.63 # Propositional unsat check successes : 0
% 11.19/3.63 # Current number of processed clauses : 2822
% 11.19/3.63 # Positive orientable unit clauses : 1117
% 11.19/3.63 # Positive unorientable unit clauses: 0
% 11.19/3.63 # Negative unit clauses : 261
% 11.19/3.63 # Non-unit-clauses : 1444
% 11.19/3.63 # Current number of unprocessed clauses: 4735
% 11.19/3.63 # ...number of literals in the above : 8201
% 11.19/3.63 # Current number of archived formulas : 0
% 11.19/3.63 # Current number of archived clauses : 120
% 11.19/3.63 # Clause-clause subsumption calls (NU) : 465471
% 11.19/3.63 # Rec. Clause-clause subsumption calls : 393658
% 11.19/3.63 # Non-unit clause-clause subsumptions : 211
% 11.19/3.63 # Unit Clause-clause subsumption calls : 54474
% 11.19/3.63 # Rewrite failures with RHS unbound : 0
% 11.19/3.63 # BW rewrite match attempts : 102
% 11.19/3.63 # BW rewrite match successes : 19
% 11.19/3.63 # Condensation attempts : 0
% 11.19/3.63 # Condensation successes : 0
% 11.19/3.63 # Termbank termtop insertions : 87401
% 11.19/3.63
% 11.19/3.63 # -------------------------------------------------
% 11.19/3.63 # User time : 0.264 s
% 11.19/3.63 # System time : 0.012 s
% 11.19/3.63 # Total time : 0.276 s
% 11.19/3.63 # ...preprocessing : 0.045 s
% 11.19/3.63 # ...main loop : 0.231 s
% 11.19/3.63 # Maximum resident set size: 22264 pages
% 11.19/3.63
%------------------------------------------------------------------------------