TSTP Solution File: CSR062+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR062+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 7.06s 2.53s
% Output : CNFRefutation 7.06s
% 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_129,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_129) ).
cnf(i_0_391,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_391) ).
cnf(i_0_1066,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_1066) ).
cnf(i_0_289,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_289) ).
cnf(i_0_1065,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_1065) ).
cnf(i_0_1063,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_1063) ).
cnf(i_0_508,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_508) ).
cnf(i_0_343,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_343) ).
cnf(i_0_658,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-em9ugzd7/input.p',i_0_658) ).
cnf(c_0_1076,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_129 ).
cnf(c_0_1077,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
i_0_391 ).
cnf(c_0_1078,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
i_0_1066 ).
cnf(c_0_1079,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_289 ).
cnf(c_0_1080,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1076,c_0_1077]),c_0_1078])]) ).
cnf(c_0_1081,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
i_0_1065 ).
cnf(c_0_1082,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_1063 ).
cnf(c_0_1083,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
i_0_508 ).
cnf(c_0_1084,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1076,c_0_1079]),c_0_1080])]) ).
cnf(c_0_1085,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_1081,c_0_1082]) ).
cnf(c_0_1086,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_343 ).
cnf(c_0_1087,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
i_0_658 ).
cnf(c_0_1088,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1083,c_0_1084])]) ).
cnf(c_0_1089,plain,
~ tptptypes_7_389(c_pushingwithfingers,X1),
inference(spm,[status(thm)],[c_0_1085,c_0_1086]) ).
cnf(c_0_1090,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1087,c_0_1088]),c_0_1089]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR062+2 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.31 % Computer : n010.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sat Jun 11 01:00:27 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.17/0.42 # ENIGMATIC: Selected SinE mode:
% 0.17/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.06/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.06/2.53 # Version: 2.1pre011
% 7.06/2.53 # Preprocessing time : 0.024 s
% 7.06/2.53
% 7.06/2.53 # Proof found!
% 7.06/2.53 # SZS status Theorem
% 7.06/2.53 # SZS output start CNFRefutation
% See solution above
% 7.06/2.53 # Proof object total steps : 24
% 7.06/2.53 # Proof object clause steps : 15
% 7.06/2.53 # Proof object formula steps : 9
% 7.06/2.53 # Proof object conjectures : 5
% 7.06/2.53 # Proof object clause conjectures : 3
% 7.06/2.53 # Proof object formula conjectures : 2
% 7.06/2.53 # Proof object initial clauses used : 9
% 7.06/2.53 # Proof object initial formulas used : 9
% 7.06/2.53 # Proof object generating inferences : 5
% 7.06/2.53 # Proof object simplifying inferences : 7
% 7.06/2.53 # Training examples: 0 positive, 0 negative
% 7.06/2.53 # Parsed axioms : 1066
% 7.06/2.53 # Removed by relevancy pruning/SinE : 0
% 7.06/2.53 # Initial clauses : 1066
% 7.06/2.53 # Removed in clause preprocessing : 0
% 7.06/2.53 # Initial clauses in saturation : 1066
% 7.06/2.53 # Processed clauses : 1768
% 7.06/2.53 # ...of these trivial : 150
% 7.06/2.53 # ...subsumed : 40
% 7.06/2.53 # ...remaining for further processing : 1578
% 7.06/2.53 # Other redundant clauses eliminated : 0
% 7.06/2.53 # Clauses deleted for lack of memory : 0
% 7.06/2.53 # Backward-subsumed : 0
% 7.06/2.53 # Backward-rewritten : 25
% 7.06/2.53 # Generated clauses : 3025
% 7.06/2.53 # ...of the previous two non-trivial : 2816
% 7.06/2.53 # Contextual simplify-reflections : 0
% 7.06/2.53 # Paramodulations : 3025
% 7.06/2.53 # Factorizations : 0
% 7.06/2.53 # Equation resolutions : 0
% 7.06/2.53 # Propositional unsat checks : 0
% 7.06/2.53 # Propositional unsat check successes : 0
% 7.06/2.53 # Current number of processed clauses : 1553
% 7.06/2.53 # Positive orientable unit clauses : 529
% 7.06/2.53 # Positive unorientable unit clauses: 0
% 7.06/2.53 # Negative unit clauses : 179
% 7.06/2.53 # Non-unit-clauses : 845
% 7.06/2.53 # Current number of unprocessed clauses: 2091
% 7.06/2.53 # ...number of literals in the above : 3629
% 7.06/2.53 # Current number of archived formulas : 0
% 7.06/2.53 # Current number of archived clauses : 25
% 7.06/2.53 # Clause-clause subsumption calls (NU) : 97073
% 7.06/2.53 # Rec. Clause-clause subsumption calls : 91119
% 7.06/2.53 # Non-unit clause-clause subsumptions : 33
% 7.06/2.53 # Unit Clause-clause subsumption calls : 60823
% 7.06/2.53 # Rewrite failures with RHS unbound : 0
% 7.06/2.53 # BW rewrite match attempts : 9
% 7.06/2.53 # BW rewrite match successes : 6
% 7.06/2.53 # Condensation attempts : 0
% 7.06/2.53 # Condensation successes : 0
% 7.06/2.53 # Termbank termtop insertions : 37317
% 7.06/2.53
% 7.06/2.53 # -------------------------------------------------
% 7.06/2.53 # User time : 0.100 s
% 7.06/2.53 # System time : 0.004 s
% 7.06/2.53 # Total time : 0.104 s
% 7.06/2.53 # ...preprocessing : 0.024 s
% 7.06/2.53 # ...main loop : 0.080 s
% 7.06/2.53 # Maximum resident set size: 11548 pages
% 7.06/2.53
%------------------------------------------------------------------------------