TSTP Solution File: CSR030+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR030+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:40 EDT 2022
% Result : Theorem 9.68s 3.87s
% Output : CNFRefutation 9.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 28 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2561,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_2561) ).
cnf(i_0_76,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_76) ).
cnf(i_0_133,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_133) ).
cnf(i_0_45,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_45) ).
cnf(i_0_2193,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_2193) ).
cnf(i_0_260,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_260) ).
cnf(i_0_2562,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_f5grax/input.p',i_0_2562) ).
cnf(c_0_2570,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
i_0_2561 ).
cnf(c_0_2571,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_76 ).
cnf(c_0_2572,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_2570,c_0_2571]) ).
cnf(c_0_2573,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_133 ).
cnf(c_0_2574,plain,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_2572,c_0_2573]) ).
cnf(c_0_2575,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
i_0_45 ).
cnf(c_0_2576,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2193 ).
cnf(c_0_2577,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
i_0_260 ).
cnf(c_0_2578,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
i_0_2562 ).
cnf(c_0_2579,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(spm,[status(thm)],[c_0_2574,c_0_2575]) ).
cnf(c_0_2580,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2576,c_0_2577]),c_0_2578])]),c_0_2579]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR030+4 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Fri Jun 10 20:55:23 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.92/1.09 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.92/1.09 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.92/1.09 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.92/1.09 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.68/3.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.68/3.87 # Version: 2.1pre011
% 9.68/3.87 # Preprocessing time : 0.057 s
% 9.68/3.87
% 9.68/3.87 # Proof found!
% 9.68/3.87 # SZS status Theorem
% 9.68/3.87 # SZS output start CNFRefutation
% See solution above
% 9.68/3.87 # Proof object total steps : 18
% 9.68/3.87 # Proof object clause steps : 11
% 9.68/3.87 # Proof object formula steps : 7
% 9.68/3.87 # Proof object conjectures : 5
% 9.68/3.87 # Proof object clause conjectures : 3
% 9.68/3.87 # Proof object formula conjectures : 2
% 9.68/3.87 # Proof object initial clauses used : 7
% 9.68/3.87 # Proof object initial formulas used : 7
% 9.68/3.87 # Proof object generating inferences : 4
% 9.68/3.87 # Proof object simplifying inferences : 3
% 9.68/3.87 # Training examples: 0 positive, 0 negative
% 9.68/3.87 # Parsed axioms : 2561
% 9.68/3.87 # Removed by relevancy pruning/SinE : 0
% 9.68/3.87 # Initial clauses : 2561
% 9.68/3.87 # Removed in clause preprocessing : 0
% 9.68/3.87 # Initial clauses in saturation : 2561
% 9.68/3.87 # Processed clauses : 2582
% 9.68/3.87 # ...of these trivial : 91
% 9.68/3.87 # ...subsumed : 68
% 9.68/3.87 # ...remaining for further processing : 2422
% 9.68/3.87 # Other redundant clauses eliminated : 2
% 9.68/3.87 # Clauses deleted for lack of memory : 0
% 9.68/3.87 # Backward-subsumed : 3
% 9.68/3.87 # Backward-rewritten : 23
% 9.68/3.87 # Generated clauses : 5727
% 9.68/3.87 # ...of the previous two non-trivial : 4786
% 9.68/3.87 # Contextual simplify-reflections : 5
% 9.68/3.87 # Paramodulations : 5725
% 9.68/3.87 # Factorizations : 0
% 9.68/3.87 # Equation resolutions : 2
% 9.68/3.87 # Propositional unsat checks : 0
% 9.68/3.87 # Propositional unsat check successes : 0
% 9.68/3.87 # Current number of processed clauses : 2394
% 9.68/3.87 # Positive orientable unit clauses : 1431
% 9.68/3.87 # Positive unorientable unit clauses: 0
% 9.68/3.87 # Negative unit clauses : 7
% 9.68/3.87 # Non-unit-clauses : 956
% 9.68/3.87 # Current number of unprocessed clauses: 4654
% 9.68/3.87 # ...number of literals in the above : 8046
% 9.68/3.87 # Current number of archived formulas : 0
% 9.68/3.87 # Current number of archived clauses : 26
% 9.68/3.87 # Clause-clause subsumption calls (NU) : 124322
% 9.68/3.87 # Rec. Clause-clause subsumption calls : 116783
% 9.68/3.87 # Non-unit clause-clause subsumptions : 73
% 9.68/3.87 # Unit Clause-clause subsumption calls : 18037
% 9.68/3.87 # Rewrite failures with RHS unbound : 0
% 9.68/3.87 # BW rewrite match attempts : 2443
% 9.68/3.87 # BW rewrite match successes : 13
% 9.68/3.87 # Condensation attempts : 0
% 9.68/3.87 # Condensation successes : 0
% 9.68/3.87 # Termbank termtop insertions : 92813
% 9.68/3.87
% 9.68/3.87 # -------------------------------------------------
% 9.68/3.87 # User time : 0.182 s
% 9.68/3.87 # System time : 0.008 s
% 9.68/3.87 # Total time : 0.190 s
% 9.68/3.87 # ...preprocessing : 0.057 s
% 9.68/3.87 # ...main loop : 0.132 s
% 9.68/3.87 # Maximum resident set size: 21536 pages
% 9.68/3.87
%------------------------------------------------------------------------------