TSTP Solution File: CSR056+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR056+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:08 EDT 2022
% Result : Theorem 9.20s 3.22s
% Output : CNFRefutation 9.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 35 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 11 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2445,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_2445) ).
cnf(i_0_1022,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_1022) ).
cnf(i_0_2541,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_2541) ).
cnf(i_0_1144,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_1144) ).
cnf(i_0_2475,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_member3717_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_2475) ).
cnf(i_0_344,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_344) ).
cnf(i_0_2540,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_2540) ).
cnf(i_0_161,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs2cbr0u/input.p',i_0_161) ).
cnf(c_0_2550,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2445 ).
cnf(c_0_2551,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
i_0_1022 ).
cnf(c_0_2552,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
i_0_2541 ).
cnf(c_0_2553,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_1144 ).
cnf(c_0_2554,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2550,c_0_2551]),c_0_2552])]) ).
cnf(c_0_2555,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_member3717_mt) ),
i_0_2475 ).
cnf(c_0_2556,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
i_0_344 ).
cnf(c_0_2557,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2550,c_0_2553]),c_0_2554])]) ).
cnf(c_0_2558,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
i_0_2540 ).
cnf(c_0_2559,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2555,c_0_2552])]) ).
cnf(c_0_2560,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
i_0_161 ).
cnf(c_0_2561,plain,
artsupplies(c_tptpartsupplies),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2556,c_0_2557])]) ).
cnf(c_0_2562,negated_conjecture,
~ supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_2558,c_0_2559]) ).
cnf(c_0_2563,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2560,c_0_2561]),c_0_2562]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR056+3 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 9 16:45:49 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.57 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.57 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.57 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.57 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.20/3.22 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.20/3.22 # Version: 2.1pre011
% 9.20/3.22 # Preprocessing time : 0.052 s
% 9.20/3.22
% 9.20/3.22 # Proof found!
% 9.20/3.22 # SZS status Theorem
% 9.20/3.22 # SZS output start CNFRefutation
% See solution above
% 9.20/3.22 # Proof object total steps : 22
% 9.20/3.22 # Proof object clause steps : 14
% 9.20/3.22 # Proof object formula steps : 8
% 9.20/3.22 # Proof object conjectures : 5
% 9.20/3.22 # Proof object clause conjectures : 3
% 9.20/3.22 # Proof object formula conjectures : 2
% 9.20/3.22 # Proof object initial clauses used : 8
% 9.20/3.22 # Proof object initial formulas used : 8
% 9.20/3.22 # Proof object generating inferences : 4
% 9.20/3.22 # Proof object simplifying inferences : 9
% 9.20/3.22 # Training examples: 0 positive, 0 negative
% 9.20/3.22 # Parsed axioms : 2541
% 9.20/3.22 # Removed by relevancy pruning/SinE : 0
% 9.20/3.22 # Initial clauses : 2541
% 9.20/3.22 # Removed in clause preprocessing : 0
% 9.20/3.22 # Initial clauses in saturation : 2541
% 9.20/3.22 # Processed clauses : 2896
% 9.20/3.22 # ...of these trivial : 213
% 9.20/3.22 # ...subsumed : 193
% 9.20/3.22 # ...remaining for further processing : 2490
% 9.20/3.22 # Other redundant clauses eliminated : 0
% 9.20/3.22 # Clauses deleted for lack of memory : 0
% 9.20/3.22 # Backward-subsumed : 2
% 9.20/3.22 # Backward-rewritten : 94
% 9.20/3.22 # Generated clauses : 5677
% 9.20/3.22 # ...of the previous two non-trivial : 5308
% 9.20/3.22 # Contextual simplify-reflections : 9
% 9.20/3.22 # Paramodulations : 5677
% 9.20/3.22 # Factorizations : 0
% 9.20/3.22 # Equation resolutions : 0
% 9.20/3.22 # Propositional unsat checks : 0
% 9.20/3.22 # Propositional unsat check successes : 0
% 9.20/3.22 # Current number of processed clauses : 2394
% 9.20/3.22 # Positive orientable unit clauses : 826
% 9.20/3.22 # Positive unorientable unit clauses: 0
% 9.20/3.22 # Negative unit clauses : 66
% 9.20/3.22 # Non-unit-clauses : 1502
% 9.20/3.22 # Current number of unprocessed clauses: 4779
% 9.20/3.22 # ...number of literals in the above : 8826
% 9.20/3.22 # Current number of archived formulas : 0
% 9.20/3.22 # Current number of archived clauses : 96
% 9.20/3.22 # Clause-clause subsumption calls (NU) : 381503
% 9.20/3.22 # Rec. Clause-clause subsumption calls : 348538
% 9.20/3.22 # Non-unit clause-clause subsumptions : 198
% 9.20/3.22 # Unit Clause-clause subsumption calls : 41240
% 9.20/3.22 # Rewrite failures with RHS unbound : 0
% 9.20/3.22 # BW rewrite match attempts : 31
% 9.20/3.22 # BW rewrite match successes : 10
% 9.20/3.22 # Condensation attempts : 0
% 9.20/3.22 # Condensation successes : 0
% 9.20/3.22 # Termbank termtop insertions : 83992
% 9.20/3.22
% 9.20/3.22 # -------------------------------------------------
% 9.20/3.22 # User time : 0.219 s
% 9.20/3.22 # System time : 0.011 s
% 9.20/3.22 # Total time : 0.230 s
% 9.20/3.22 # ...preprocessing : 0.052 s
% 9.20/3.22 # ...main loop : 0.178 s
% 9.20/3.22 # Maximum resident set size: 20064 pages
% 9.20/3.22
%------------------------------------------------------------------------------