TSTP Solution File: CSR062+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR062+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:15 EDT 2022
% Result : Theorem 21.42s 12.99s
% Output : CNFRefutation 21.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 36 ( 0 equ; 16 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_2279,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_2279) ).
cnf(i_0_1037,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_1037) ).
cnf(i_0_2680,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_2680) ).
cnf(i_0_543,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_543) ).
cnf(i_0_2679,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_2679) ).
cnf(i_0_1470,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_1470) ).
cnf(i_0_1255,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_1255) ).
cnf(i_0_416,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_416) ).
cnf(i_0_31,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dorpro2_/input.p',i_0_31) ).
cnf(c_0_2690,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2279 ).
cnf(c_0_2691,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
i_0_1037 ).
cnf(c_0_2692,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
i_0_2680 ).
cnf(c_0_2693,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_543 ).
cnf(c_0_2694,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2690,c_0_2691]),c_0_2692])]) ).
cnf(c_0_2695,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
i_0_2679 ).
cnf(c_0_2696,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_1470 ).
cnf(c_0_2697,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
i_0_1255 ).
cnf(c_0_2698,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2690,c_0_2693]),c_0_2694])]) ).
cnf(c_0_2699,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_2695,c_0_2696]) ).
cnf(c_0_2700,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_416 ).
cnf(c_0_2701,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
i_0_31 ).
cnf(c_0_2702,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2697,c_0_2698])]) ).
cnf(c_0_2703,plain,
~ tptptypes_7_389(c_pushingwithfingers,X1),
inference(spm,[status(thm)],[c_0_2699,c_0_2700]) ).
cnf(c_0_2704,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2701,c_0_2702]),c_0_2703]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : CSR062+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n008.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 06:12:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 9.44/9.68 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.44/9.68 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 9.44/9.68 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 9.44/9.68 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 21.42/12.99 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 21.42/12.99 # Version: 2.1pre011
% 21.42/12.99 # Preprocessing time : 0.076 s
% 21.42/12.99
% 21.42/12.99 # Proof found!
% 21.42/12.99 # SZS status Theorem
% 21.42/12.99 # SZS output start CNFRefutation
% See solution above
% 21.42/12.99 # Proof object total steps : 24
% 21.42/12.99 # Proof object clause steps : 15
% 21.42/12.99 # Proof object formula steps : 9
% 21.42/12.99 # Proof object conjectures : 5
% 21.42/12.99 # Proof object clause conjectures : 3
% 21.42/12.99 # Proof object formula conjectures : 2
% 21.42/12.99 # Proof object initial clauses used : 9
% 21.42/12.99 # Proof object initial formulas used : 9
% 21.42/12.99 # Proof object generating inferences : 5
% 21.42/12.99 # Proof object simplifying inferences : 7
% 21.42/12.99 # Training examples: 0 positive, 0 negative
% 21.42/12.99 # Parsed axioms : 2678
% 21.42/12.99 # Removed by relevancy pruning/SinE : 0
% 21.42/12.99 # Initial clauses : 2678
% 21.42/12.99 # Removed in clause preprocessing : 0
% 21.42/12.99 # Initial clauses in saturation : 2678
% 21.42/12.99 # Processed clauses : 3592
% 21.42/12.99 # ...of these trivial : 378
% 21.42/12.99 # ...subsumed : 98
% 21.42/12.99 # ...remaining for further processing : 3116
% 21.42/12.99 # Other redundant clauses eliminated : 5
% 21.42/12.99 # Clauses deleted for lack of memory : 0
% 21.42/12.99 # Backward-subsumed : 5
% 21.42/12.99 # Backward-rewritten : 249
% 21.42/12.99 # Generated clauses : 7355
% 21.42/12.99 # ...of the previous two non-trivial : 6798
% 21.42/12.99 # Contextual simplify-reflections : 0
% 21.42/12.99 # Paramodulations : 7350
% 21.42/12.99 # Factorizations : 0
% 21.42/12.99 # Equation resolutions : 5
% 21.42/12.99 # Propositional unsat checks : 0
% 21.42/12.99 # Propositional unsat check successes : 0
% 21.42/12.99 # Current number of processed clauses : 2857
% 21.42/12.99 # Positive orientable unit clauses : 1495
% 21.42/12.99 # Positive unorientable unit clauses: 0
% 21.42/12.99 # Negative unit clauses : 214
% 21.42/12.99 # Non-unit-clauses : 1148
% 21.42/12.99 # Current number of unprocessed clauses: 5401
% 21.42/12.99 # ...number of literals in the above : 10166
% 21.42/12.99 # Current number of archived formulas : 0
% 21.42/12.99 # Current number of archived clauses : 254
% 21.42/12.99 # Clause-clause subsumption calls (NU) : 350616
% 21.42/12.99 # Rec. Clause-clause subsumption calls : 276643
% 21.42/12.99 # Non-unit clause-clause subsumptions : 72
% 21.42/12.99 # Unit Clause-clause subsumption calls : 136334
% 21.42/12.99 # Rewrite failures with RHS unbound : 0
% 21.42/12.99 # BW rewrite match attempts : 1710
% 21.42/12.99 # BW rewrite match successes : 69
% 21.42/12.99 # Condensation attempts : 0
% 21.42/12.99 # Condensation successes : 0
% 21.42/12.99 # Termbank termtop insertions : 102206
% 21.42/12.99
% 21.42/12.99 # -------------------------------------------------
% 21.42/12.99 # User time : 0.327 s
% 21.42/12.99 # System time : 0.014 s
% 21.42/12.99 # Total time : 0.341 s
% 21.42/12.99 # ...preprocessing : 0.076 s
% 21.42/12.99 # ...main loop : 0.265 s
% 21.42/12.99 # Maximum resident set size: 25248 pages
% 21.42/12.99
%------------------------------------------------------------------------------