TSTP Solution File: CSR030+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR030+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:41 EDT 2022
% Result : Theorem 20.24s 13.46s
% Output : CNFRefutation 20.24s
% 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_2616,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_2616) ).
cnf(i_0_1289,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_1289) ).
cnf(i_0_398,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_398) ).
cnf(i_0_621,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_621) ).
cnf(i_0_2239,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_2239) ).
cnf(i_0_2403,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_2403) ).
cnf(i_0_2617,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tdgxg9by/input.p',i_0_2617) ).
cnf(c_0_2625,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
i_0_2616 ).
cnf(c_0_2626,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_1289 ).
cnf(c_0_2627,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_2625,c_0_2626]) ).
cnf(c_0_2628,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_398 ).
cnf(c_0_2629,plain,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_2627,c_0_2628]) ).
cnf(c_0_2630,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
i_0_621 ).
cnf(c_0_2631,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2239 ).
cnf(c_0_2632,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
i_0_2403 ).
cnf(c_0_2633,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
i_0_2617 ).
cnf(c_0_2634,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(spm,[status(thm)],[c_0_2629,c_0_2630]) ).
cnf(c_0_2635,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2631,c_0_2632]),c_0_2633])]),c_0_2634]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.08 % Problem : CSR030+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.03/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.30 % Computer : n023.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 600
% 0.08/0.30 % DateTime : Fri Jun 10 13:03:24 EDT 2022
% 0.08/0.30 % CPUTime :
% 0.14/0.41 # ENIGMATIC: Selected SinE mode:
% 10.13/10.34 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.13/10.34 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 10.13/10.34 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 10.13/10.34 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 20.24/13.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 20.24/13.46 # Version: 2.1pre011
% 20.24/13.46 # Preprocessing time : 0.055 s
% 20.24/13.46
% 20.24/13.46 # Proof found!
% 20.24/13.46 # SZS status Theorem
% 20.24/13.46 # SZS output start CNFRefutation
% See solution above
% 20.24/13.47 # Proof object total steps : 18
% 20.24/13.47 # Proof object clause steps : 11
% 20.24/13.47 # Proof object formula steps : 7
% 20.24/13.47 # Proof object conjectures : 5
% 20.24/13.47 # Proof object clause conjectures : 3
% 20.24/13.47 # Proof object formula conjectures : 2
% 20.24/13.47 # Proof object initial clauses used : 7
% 20.24/13.47 # Proof object initial formulas used : 7
% 20.24/13.47 # Proof object generating inferences : 4
% 20.24/13.47 # Proof object simplifying inferences : 3
% 20.24/13.47 # Training examples: 0 positive, 0 negative
% 20.24/13.47 # Parsed axioms : 2615
% 20.24/13.47 # Removed by relevancy pruning/SinE : 0
% 20.24/13.47 # Initial clauses : 2615
% 20.24/13.47 # Removed in clause preprocessing : 0
% 20.24/13.47 # Initial clauses in saturation : 2615
% 20.24/13.47 # Processed clauses : 2630
% 20.24/13.47 # ...of these trivial : 144
% 20.24/13.47 # ...subsumed : 80
% 20.24/13.47 # ...remaining for further processing : 2405
% 20.24/13.47 # Other redundant clauses eliminated : 5
% 20.24/13.47 # Clauses deleted for lack of memory : 0
% 20.24/13.47 # Backward-subsumed : 3
% 20.24/13.47 # Backward-rewritten : 95
% 20.24/13.47 # Generated clauses : 6395
% 20.24/13.47 # ...of the previous two non-trivial : 6057
% 20.24/13.47 # Contextual simplify-reflections : 0
% 20.24/13.47 # Paramodulations : 6390
% 20.24/13.47 # Factorizations : 0
% 20.24/13.47 # Equation resolutions : 5
% 20.24/13.47 # Propositional unsat checks : 0
% 20.24/13.47 # Propositional unsat check successes : 0
% 20.24/13.47 # Current number of processed clauses : 2302
% 20.24/13.47 # Positive orientable unit clauses : 1385
% 20.24/13.47 # Positive unorientable unit clauses: 0
% 20.24/13.47 # Negative unit clauses : 16
% 20.24/13.47 # Non-unit-clauses : 901
% 20.24/13.47 # Current number of unprocessed clauses: 5669
% 20.24/13.47 # ...number of literals in the above : 10177
% 20.24/13.47 # Current number of archived formulas : 0
% 20.24/13.47 # Current number of archived clauses : 98
% 20.24/13.47 # Clause-clause subsumption calls (NU) : 105774
% 20.24/13.47 # Rec. Clause-clause subsumption calls : 94047
% 20.24/13.47 # Non-unit clause-clause subsumptions : 81
% 20.24/13.47 # Unit Clause-clause subsumption calls : 5978
% 20.24/13.47 # Rewrite failures with RHS unbound : 0
% 20.24/13.47 # BW rewrite match attempts : 368
% 20.24/13.47 # BW rewrite match successes : 85
% 20.24/13.47 # Condensation attempts : 0
% 20.24/13.47 # Condensation successes : 0
% 20.24/13.47 # Termbank termtop insertions : 94553
% 20.24/13.47
% 20.24/13.47 # -------------------------------------------------
% 20.24/13.47 # User time : 0.178 s
% 20.24/13.47 # System time : 0.017 s
% 20.24/13.47 # Total time : 0.195 s
% 20.24/13.47 # ...preprocessing : 0.055 s
% 20.24/13.47 # ...main loop : 0.140 s
% 20.24/13.47 # Maximum resident set size: 25444 pages
% 20.24/13.47
%------------------------------------------------------------------------------