TSTP Solution File: CSR030+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR030+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 15.13s 4.76s
% Output : CNFRefutation 15.13s
% 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_2568,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_2568) ).
cnf(i_0_50,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_50) ).
cnf(i_0_168,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_168) ).
cnf(i_0_71,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_71) ).
cnf(i_0_2453,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_2453) ).
cnf(i_0_538,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_538) ).
cnf(i_0_2569,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bcpi7zzv/input.p',i_0_2569) ).
cnf(c_0_2577,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
i_0_2568 ).
cnf(c_0_2578,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_50 ).
cnf(c_0_2579,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_2577,c_0_2578]) ).
cnf(c_0_2580,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_168 ).
cnf(c_0_2581,plain,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_2579,c_0_2580]) ).
cnf(c_0_2582,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
i_0_71 ).
cnf(c_0_2583,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2453 ).
cnf(c_0_2584,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
i_0_538 ).
cnf(c_0_2585,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
i_0_2569 ).
cnf(c_0_2586,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(spm,[status(thm)],[c_0_2581,c_0_2582]) ).
cnf(c_0_2587,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2583,c_0_2584]),c_0_2585])]),c_0_2586]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : CSR030+3 : TPTP v8.1.0. Released v3.4.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.30 % Computer : n016.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sat Jun 11 17:40:43 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.40 # ENIGMATIC: Selected SinE mode:
% 0.38/0.56 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.56 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.38/0.56 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.38/0.56 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.13/4.75 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 15.13/4.76 # Version: 2.1pre011
% 15.13/4.76 # Preprocessing time : 0.075 s
% 15.13/4.76
% 15.13/4.76 # Proof found!
% 15.13/4.76 # SZS status Theorem
% 15.13/4.76 # SZS output start CNFRefutation
% See solution above
% 15.13/4.76 # Proof object total steps : 18
% 15.13/4.76 # Proof object clause steps : 11
% 15.13/4.76 # Proof object formula steps : 7
% 15.13/4.76 # Proof object conjectures : 5
% 15.13/4.76 # Proof object clause conjectures : 3
% 15.13/4.76 # Proof object formula conjectures : 2
% 15.13/4.76 # Proof object initial clauses used : 7
% 15.13/4.76 # Proof object initial formulas used : 7
% 15.13/4.76 # Proof object generating inferences : 4
% 15.13/4.76 # Proof object simplifying inferences : 3
% 15.13/4.76 # Training examples: 0 positive, 0 negative
% 15.13/4.76 # Parsed axioms : 2569
% 15.13/4.76 # Removed by relevancy pruning/SinE : 0
% 15.13/4.76 # Initial clauses : 2569
% 15.13/4.76 # Removed in clause preprocessing : 0
% 15.13/4.76 # Initial clauses in saturation : 2569
% 15.13/4.76 # Processed clauses : 2618
% 15.13/4.76 # ...of these trivial : 162
% 15.13/4.76 # ...subsumed : 202
% 15.13/4.76 # ...remaining for further processing : 2253
% 15.13/4.76 # Other redundant clauses eliminated : 0
% 15.13/4.76 # Clauses deleted for lack of memory : 0
% 15.13/4.76 # Backward-subsumed : 0
% 15.13/4.76 # Backward-rewritten : 3
% 15.13/4.76 # Generated clauses : 3745
% 15.13/4.76 # ...of the previous two non-trivial : 3388
% 15.13/4.76 # Contextual simplify-reflections : 13
% 15.13/4.76 # Paramodulations : 3745
% 15.13/4.76 # Factorizations : 0
% 15.13/4.76 # Equation resolutions : 0
% 15.13/4.76 # Propositional unsat checks : 0
% 15.13/4.76 # Propositional unsat check successes : 0
% 15.13/4.76 # Current number of processed clauses : 2250
% 15.13/4.76 # Positive orientable unit clauses : 977
% 15.13/4.76 # Positive unorientable unit clauses: 0
% 15.13/4.76 # Negative unit clauses : 31
% 15.13/4.76 # Non-unit-clauses : 1242
% 15.13/4.76 # Current number of unprocessed clauses: 3335
% 15.13/4.76 # ...number of literals in the above : 5370
% 15.13/4.76 # Current number of archived formulas : 0
% 15.13/4.76 # Current number of archived clauses : 3
% 15.13/4.76 # Clause-clause subsumption calls (NU) : 278840
% 15.13/4.76 # Rec. Clause-clause subsumption calls : 251841
% 15.13/4.76 # Non-unit clause-clause subsumptions : 213
% 15.13/4.76 # Unit Clause-clause subsumption calls : 22066
% 15.13/4.76 # Rewrite failures with RHS unbound : 0
% 15.13/4.76 # BW rewrite match attempts : 15
% 15.13/4.76 # BW rewrite match successes : 3
% 15.13/4.76 # Condensation attempts : 0
% 15.13/4.76 # Condensation successes : 0
% 15.13/4.76 # Termbank termtop insertions : 63044
% 15.13/4.76
% 15.13/4.76 # -------------------------------------------------
% 15.13/4.76 # User time : 0.247 s
% 15.13/4.76 # System time : 0.012 s
% 15.13/4.76 # Total time : 0.259 s
% 15.13/4.76 # ...preprocessing : 0.075 s
% 15.13/4.76 # ...main loop : 0.185 s
% 15.13/4.76 # Maximum resident set size: 18664 pages
% 15.13/4.76
%------------------------------------------------------------------------------