TSTP Solution File: CSR073+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR073+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:27 EDT 2022
% Result : Theorem 11.50s 3.87s
% Output : CNFRefutation 11.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 0 nHn; 17 RR)
% Number of literals : 27 ( 0 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1136,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_1136) ).
cnf(i_0_403,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_403) ).
cnf(i_0_2668,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_2668) ).
cnf(i_0_87,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_87) ).
cnf(i_0_478,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_478) ).
cnf(i_0_1186,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j3716vld/input.p',i_0_1186) ).
cnf(c_0_2675,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
i_0_1136 ).
cnf(c_0_2676,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
i_0_403 ).
cnf(c_0_2677,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
i_0_2668 ).
cnf(c_0_2678,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_87 ).
cnf(c_0_2679,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
i_0_478 ).
cnf(c_0_2680,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(spm,[status(thm)],[c_0_2675,c_0_2676]) ).
cnf(c_0_2681,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_2677,c_0_2678]) ).
cnf(c_0_2682,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(spm,[status(thm)],[c_0_2679,c_0_2680]) ).
cnf(c_0_2683,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
i_0_1186 ).
cnf(c_0_2684,negated_conjecture,
~ tptptypes_9_401(c_pushingababycarriage,X1),
inference(spm,[status(thm)],[c_0_2681,c_0_2682]) ).
cnf(c_0_2685,plain,
$false,
inference(sr,[status(thm)],[c_0_2683,c_0_2684]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR073+4 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 10 15:47:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.89/1.07 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.89/1.07 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.89/1.07 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.89/1.07 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.50/3.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.50/3.87 # Version: 2.1pre011
% 11.50/3.87 # Preprocessing time : 0.056 s
% 11.50/3.87
% 11.50/3.87 # Proof found!
% 11.50/3.87 # SZS status Theorem
% 11.50/3.87 # SZS output start CNFRefutation
% See solution above
% 11.50/3.87 # Proof object total steps : 17
% 11.50/3.87 # Proof object clause steps : 11
% 11.50/3.87 # Proof object formula steps : 6
% 11.50/3.87 # Proof object conjectures : 4
% 11.50/3.87 # Proof object clause conjectures : 3
% 11.50/3.87 # Proof object formula conjectures : 1
% 11.50/3.87 # Proof object initial clauses used : 6
% 11.50/3.87 # Proof object initial formulas used : 6
% 11.50/3.87 # Proof object generating inferences : 4
% 11.50/3.87 # Proof object simplifying inferences : 1
% 11.50/3.87 # Training examples: 0 positive, 0 negative
% 11.50/3.87 # Parsed axioms : 2668
% 11.50/3.87 # Removed by relevancy pruning/SinE : 0
% 11.50/3.87 # Initial clauses : 2668
% 11.50/3.87 # Removed in clause preprocessing : 0
% 11.50/3.87 # Initial clauses in saturation : 2668
% 11.50/3.87 # Processed clauses : 3226
% 11.50/3.87 # ...of these trivial : 284
% 11.50/3.87 # ...subsumed : 91
% 11.50/3.87 # ...remaining for further processing : 2851
% 11.50/3.87 # Other redundant clauses eliminated : 2
% 11.50/3.87 # Clauses deleted for lack of memory : 0
% 11.50/3.87 # Backward-subsumed : 5
% 11.50/3.87 # Backward-rewritten : 148
% 11.50/3.87 # Generated clauses : 6495
% 11.50/3.87 # ...of the previous two non-trivial : 5555
% 11.50/3.87 # Contextual simplify-reflections : 6
% 11.50/3.87 # Paramodulations : 6491
% 11.50/3.87 # Factorizations : 0
% 11.50/3.87 # Equation resolutions : 2
% 11.50/3.87 # Propositional unsat checks : 0
% 11.50/3.87 # Propositional unsat check successes : 0
% 11.50/3.87 # Current number of processed clauses : 2694
% 11.50/3.87 # Positive orientable unit clauses : 1512
% 11.50/3.87 # Positive unorientable unit clauses: 0
% 11.50/3.87 # Negative unit clauses : 92
% 11.50/3.87 # Non-unit-clauses : 1090
% 11.50/3.87 # Current number of unprocessed clauses: 4710
% 11.50/3.87 # ...number of literals in the above : 8095
% 11.50/3.87 # Current number of archived formulas : 0
% 11.50/3.87 # Current number of archived clauses : 155
% 11.50/3.87 # Clause-clause subsumption calls (NU) : 179492
% 11.50/3.87 # Rec. Clause-clause subsumption calls : 166169
% 11.50/3.87 # Non-unit clause-clause subsumptions : 97
% 11.50/3.87 # Unit Clause-clause subsumption calls : 92521
% 11.50/3.87 # Rewrite failures with RHS unbound : 0
% 11.50/3.87 # BW rewrite match attempts : 2505
% 11.50/3.87 # BW rewrite match successes : 33
% 11.50/3.87 # Condensation attempts : 0
% 11.50/3.87 # Condensation successes : 0
% 11.50/3.87 # Termbank termtop insertions : 101903
% 11.50/3.87
% 11.50/3.87 # -------------------------------------------------
% 11.50/3.87 # User time : 0.247 s
% 11.50/3.87 # System time : 0.017 s
% 11.50/3.87 # Total time : 0.264 s
% 11.50/3.87 # ...preprocessing : 0.056 s
% 11.50/3.87 # ...main loop : 0.208 s
% 11.50/3.87 # Maximum resident set size: 22292 pages
% 11.50/3.87
%------------------------------------------------------------------------------