TSTP Solution File: CSR071+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR071+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:24 EDT 2022
% Result : Theorem 10.17s 3.97s
% Output : CNFRefutation 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 37 ( 0 equ; 20 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2585,negated_conjecture,
~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_2585) ).
cnf(i_0_225,plain,
( tptpofobject(X1,f_tptpquantityfn_6(n_414))
| ~ militaryperson(X1)
| ~ mtvisible(c_tptp_member698_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_225) ).
cnf(i_0_253,plain,
( militaryperson(X1)
| ~ navypersonnel(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_253) ).
cnf(i_0_2451,plain,
( navypersonnel(c_tptpnavypersonnel_3)
| ~ mtvisible(c_tptp_member1672_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_2451) ).
cnf(i_0_2242,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_2242) ).
cnf(i_0_333,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_333) ).
cnf(i_0_2586,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_2586) ).
cnf(i_0_852,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4sp29sfq/input.p',i_0_852) ).
cnf(c_0_2595,negated_conjecture,
~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
i_0_2585 ).
cnf(c_0_2596,plain,
( tptpofobject(X1,f_tptpquantityfn_6(n_414))
| ~ militaryperson(X1)
| ~ mtvisible(c_tptp_member698_mt) ),
i_0_225 ).
cnf(c_0_2597,plain,
( militaryperson(X1)
| ~ navypersonnel(X1) ),
i_0_253 ).
cnf(c_0_2598,plain,
( navypersonnel(c_tptpnavypersonnel_3)
| ~ mtvisible(c_tptp_member1672_mt) ),
i_0_2451 ).
cnf(c_0_2599,negated_conjecture,
( ~ militaryperson(c_tptpnavypersonnel_3)
| ~ mtvisible(c_tptp_member698_mt) ),
inference(spm,[status(thm)],[c_0_2595,c_0_2596]) ).
cnf(c_0_2600,plain,
( militaryperson(c_tptpnavypersonnel_3)
| ~ mtvisible(c_tptp_member1672_mt) ),
inference(spm,[status(thm)],[c_0_2597,c_0_2598]) ).
cnf(c_0_2601,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2242 ).
cnf(c_0_2602,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
i_0_333 ).
cnf(c_0_2603,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_2586 ).
cnf(c_0_2604,negated_conjecture,
( ~ mtvisible(c_tptp_member698_mt)
| ~ mtvisible(c_tptp_member1672_mt) ),
inference(spm,[status(thm)],[c_0_2599,c_0_2600]) ).
cnf(c_0_2605,plain,
mtvisible(c_tptp_member698_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2601,c_0_2602]),c_0_2603])]) ).
cnf(c_0_2606,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
i_0_852 ).
cnf(c_0_2607,negated_conjecture,
~ mtvisible(c_tptp_member1672_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2604,c_0_2605])]) ).
cnf(c_0_2608,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2601,c_0_2606]),c_0_2603])]),c_0_2607]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR071+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 10 19:33:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.92/1.11 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.92/1.11 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.92/1.11 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.92/1.11 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.17/3.97 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 10.17/3.97 # Version: 2.1pre011
% 10.17/3.97 # Preprocessing time : 0.066 s
% 10.17/3.97
% 10.17/3.97 # Proof found!
% 10.17/3.97 # SZS status Theorem
% 10.17/3.97 # SZS output start CNFRefutation
% See solution above
% 10.17/3.97 # Proof object total steps : 22
% 10.17/3.97 # Proof object clause steps : 14
% 10.17/3.97 # Proof object formula steps : 8
% 10.17/3.97 # Proof object conjectures : 7
% 10.17/3.97 # Proof object clause conjectures : 5
% 10.17/3.97 # Proof object formula conjectures : 2
% 10.17/3.97 # Proof object initial clauses used : 8
% 10.17/3.97 # Proof object initial formulas used : 8
% 10.17/3.97 # Proof object generating inferences : 5
% 10.17/3.97 # Proof object simplifying inferences : 7
% 10.17/3.97 # Training examples: 0 positive, 0 negative
% 10.17/3.97 # Parsed axioms : 2585
% 10.17/3.97 # Removed by relevancy pruning/SinE : 0
% 10.17/3.97 # Initial clauses : 2585
% 10.17/3.97 # Removed in clause preprocessing : 0
% 10.17/3.97 # Initial clauses in saturation : 2585
% 10.17/3.97 # Processed clauses : 2689
% 10.17/3.97 # ...of these trivial : 90
% 10.17/3.97 # ...subsumed : 102
% 10.17/3.97 # ...remaining for further processing : 2496
% 10.17/3.97 # Other redundant clauses eliminated : 2
% 10.17/3.97 # Clauses deleted for lack of memory : 0
% 10.17/3.97 # Backward-subsumed : 3
% 10.17/3.97 # Backward-rewritten : 36
% 10.17/3.97 # Generated clauses : 4679
% 10.17/3.97 # ...of the previous two non-trivial : 3653
% 10.17/3.97 # Contextual simplify-reflections : 4
% 10.17/3.97 # Paramodulations : 4677
% 10.17/3.97 # Factorizations : 0
% 10.17/3.97 # Equation resolutions : 2
% 10.17/3.97 # Propositional unsat checks : 0
% 10.17/3.97 # Propositional unsat check successes : 0
% 10.17/3.97 # Current number of processed clauses : 2455
% 10.17/3.97 # Positive orientable unit clauses : 1256
% 10.17/3.97 # Positive unorientable unit clauses: 0
% 10.17/3.97 # Negative unit clauses : 42
% 10.17/3.97 # Non-unit-clauses : 1157
% 10.17/3.97 # Current number of unprocessed clauses: 3334
% 10.17/3.97 # ...number of literals in the above : 5602
% 10.17/3.97 # Current number of archived formulas : 0
% 10.17/3.97 # Current number of archived clauses : 39
% 10.17/3.97 # Clause-clause subsumption calls (NU) : 204408
% 10.17/3.97 # Rec. Clause-clause subsumption calls : 177298
% 10.17/3.97 # Non-unit clause-clause subsumptions : 101
% 10.17/3.97 # Unit Clause-clause subsumption calls : 37220
% 10.17/3.97 # Rewrite failures with RHS unbound : 0
% 10.17/3.97 # BW rewrite match attempts : 2042
% 10.17/3.97 # BW rewrite match successes : 19
% 10.17/3.97 # Condensation attempts : 0
% 10.17/3.97 # Condensation successes : 0
% 10.17/3.97 # Termbank termtop insertions : 84611
% 10.17/3.97
% 10.17/3.97 # -------------------------------------------------
% 10.17/3.97 # User time : 0.208 s
% 10.17/3.97 # System time : 0.017 s
% 10.17/3.97 # Total time : 0.225 s
% 10.17/3.97 # ...preprocessing : 0.066 s
% 10.17/3.97 # ...main loop : 0.160 s
% 10.17/3.97 # Maximum resident set size: 21148 pages
% 10.17/3.97
%------------------------------------------------------------------------------