TSTP Solution File: CSR062+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR062+3 : 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:47:14 EDT 2022
% Result : Theorem 11.05s 3.67s
% Output : CNFRefutation 11.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 38 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2471,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_2471) ).
cnf(i_0_1268,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_1268) ).
cnf(i_0_450,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_450) ).
cnf(i_0_2583,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_2583) ).
cnf(i_0_2582,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_2582) ).
cnf(i_0_54,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_54) ).
cnf(i_0_15,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_15) ).
cnf(i_0_177,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_177) ).
cnf(i_0_592,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ragmp3g1/input.p',i_0_592) ).
cnf(c_0_2593,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2471 ).
cnf(c_0_2594,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_1268 ).
cnf(c_0_2595,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
i_0_450 ).
cnf(c_0_2596,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
i_0_2583 ).
cnf(c_0_2597,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_2593,c_0_2594]) ).
cnf(c_0_2598,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2593,c_0_2595]),c_0_2596])]) ).
cnf(c_0_2599,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
i_0_2582 ).
cnf(c_0_2600,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_54 ).
cnf(c_0_2601,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
i_0_15 ).
cnf(c_0_2602,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2597,c_0_2598])]) ).
cnf(c_0_2603,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_2599,c_0_2600]) ).
cnf(c_0_2604,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_177 ).
cnf(c_0_2605,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
i_0_592 ).
cnf(c_0_2606,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2601,c_0_2602])]) ).
cnf(c_0_2607,plain,
~ tptptypes_7_389(c_pushingwithfingers,X1),
inference(spm,[status(thm)],[c_0_2603,c_0_2604]) ).
cnf(c_0_2608,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2605,c_0_2606]),c_0_2607]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : CSR062+3 : TPTP v8.1.0. Released v3.4.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jun 10 01:51:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.46/0.64 # Parsing /export/starexec/sandbox/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.05/3.67 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.05/3.67 # Version: 2.1pre011
% 11.05/3.67 # Preprocessing time : 0.049 s
% 11.05/3.67
% 11.05/3.67 # Proof found!
% 11.05/3.67 # SZS status Theorem
% 11.05/3.67 # SZS output start CNFRefutation
% See solution above
% 11.05/3.67 # Proof object total steps : 25
% 11.05/3.67 # Proof object clause steps : 16
% 11.05/3.67 # Proof object formula steps : 9
% 11.05/3.67 # Proof object conjectures : 5
% 11.05/3.67 # Proof object clause conjectures : 3
% 11.05/3.67 # Proof object formula conjectures : 2
% 11.05/3.67 # Proof object initial clauses used : 9
% 11.05/3.67 # Proof object initial formulas used : 9
% 11.05/3.67 # Proof object generating inferences : 5
% 11.05/3.67 # Proof object simplifying inferences : 7
% 11.05/3.67 # Training examples: 0 positive, 0 negative
% 11.05/3.67 # Parsed axioms : 2583
% 11.05/3.67 # Removed by relevancy pruning/SinE : 0
% 11.05/3.67 # Initial clauses : 2583
% 11.05/3.67 # Removed in clause preprocessing : 0
% 11.05/3.67 # Initial clauses in saturation : 2583
% 11.05/3.67 # Processed clauses : 2668
% 11.05/3.67 # ...of these trivial : 160
% 11.05/3.67 # ...subsumed : 205
% 11.05/3.67 # ...remaining for further processing : 2303
% 11.05/3.67 # Other redundant clauses eliminated : 0
% 11.05/3.67 # Clauses deleted for lack of memory : 0
% 11.05/3.67 # Backward-subsumed : 0
% 11.05/3.67 # Backward-rewritten : 48
% 11.05/3.67 # Generated clauses : 7206
% 11.05/3.67 # ...of the previous two non-trivial : 6883
% 11.05/3.67 # Contextual simplify-reflections : 13
% 11.05/3.67 # Paramodulations : 7206
% 11.05/3.67 # Factorizations : 0
% 11.05/3.67 # Equation resolutions : 0
% 11.05/3.67 # Propositional unsat checks : 0
% 11.05/3.67 # Propositional unsat check successes : 0
% 11.05/3.67 # Current number of processed clauses : 2255
% 11.05/3.67 # Positive orientable unit clauses : 996
% 11.05/3.67 # Positive unorientable unit clauses: 0
% 11.05/3.67 # Negative unit clauses : 41
% 11.05/3.67 # Non-unit-clauses : 1218
% 11.05/3.67 # Current number of unprocessed clauses: 6705
% 11.05/3.67 # ...number of literals in the above : 12021
% 11.05/3.67 # Current number of archived formulas : 0
% 11.05/3.67 # Current number of archived clauses : 48
% 11.05/3.67 # Clause-clause subsumption calls (NU) : 225134
% 11.05/3.67 # Rec. Clause-clause subsumption calls : 199133
% 11.05/3.67 # Non-unit clause-clause subsumptions : 218
% 11.05/3.67 # Unit Clause-clause subsumption calls : 20793
% 11.05/3.67 # Rewrite failures with RHS unbound : 0
% 11.05/3.67 # BW rewrite match attempts : 17
% 11.05/3.67 # BW rewrite match successes : 5
% 11.05/3.67 # Condensation attempts : 0
% 11.05/3.67 # Condensation successes : 0
% 11.05/3.67 # Termbank termtop insertions : 91801
% 11.05/3.67
% 11.05/3.67 # -------------------------------------------------
% 11.05/3.67 # User time : 0.194 s
% 11.05/3.67 # System time : 0.010 s
% 11.05/3.67 # Total time : 0.204 s
% 11.05/3.67 # ...preprocessing : 0.049 s
% 11.05/3.67 # ...main loop : 0.155 s
% 11.05/3.67 # Maximum resident set size: 21432 pages
% 11.05/3.67
%------------------------------------------------------------------------------