TSTP Solution File: CSR083+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR083+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:36 EDT 2022
% Result : Theorem 10.81s 3.84s
% Output : CNFRefutation 10.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 11 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3663,negated_conjecture,
( X1 != s__Human
| ~ s__subclass(X1,s__Animal)
| ~ s__subclass(X1,s__CognitiveAgent) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mos99scl/input.p',i_0_3663) ).
cnf(i_0_2890,plain,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mos99scl/input.p',i_0_2890) ).
cnf(i_0_1453,plain,
s__subclass(s__Human,s__Animal),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mos99scl/input.p',i_0_1453) ).
cnf(c_0_3667,negated_conjecture,
( X1 != s__Human
| ~ s__subclass(X1,s__Animal)
| ~ s__subclass(X1,s__CognitiveAgent) ),
i_0_3663 ).
cnf(c_0_3668,plain,
s__subclass(s__Human,s__CognitiveAgent),
i_0_2890 ).
cnf(c_0_3669,plain,
s__subclass(s__Human,s__Animal),
i_0_1453 ).
cnf(c_0_3670,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3667,c_0_3668]),c_0_3669])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR083+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 : Sat Jun 11 18:47:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.69/0.90 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.69/0.90 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.69/0.90 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.69/0.90 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.81/3.84 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.81/3.84 # Version: 2.1pre011
% 10.81/3.84 # Preprocessing time : 0.086 s
% 10.81/3.84
% 10.81/3.84 # Proof found!
% 10.81/3.84 # SZS status Theorem
% 10.81/3.84 # SZS output start CNFRefutation
% See solution above
% 10.81/3.84 # Proof object total steps : 7
% 10.81/3.84 # Proof object clause steps : 4
% 10.81/3.84 # Proof object formula steps : 3
% 10.81/3.84 # Proof object conjectures : 3
% 10.81/3.84 # Proof object clause conjectures : 2
% 10.81/3.84 # Proof object formula conjectures : 1
% 10.81/3.84 # Proof object initial clauses used : 3
% 10.81/3.84 # Proof object initial formulas used : 3
% 10.81/3.84 # Proof object generating inferences : 1
% 10.81/3.84 # Proof object simplifying inferences : 2
% 10.81/3.84 # Training examples: 0 positive, 0 negative
% 10.81/3.84 # Parsed axioms : 3675
% 10.81/3.84 # Removed by relevancy pruning/SinE : 0
% 10.81/3.84 # Initial clauses : 3675
% 10.81/3.84 # Removed in clause preprocessing : 0
% 10.81/3.84 # Initial clauses in saturation : 3675
% 10.81/3.84 # Processed clauses : 10
% 10.81/3.84 # ...of these trivial : 0
% 10.81/3.84 # ...subsumed : 0
% 10.81/3.84 # ...remaining for further processing : 10
% 10.81/3.84 # Other redundant clauses eliminated : 0
% 10.81/3.84 # Clauses deleted for lack of memory : 0
% 10.81/3.84 # Backward-subsumed : 0
% 10.81/3.84 # Backward-rewritten : 0
% 10.81/3.84 # Generated clauses : 1
% 10.81/3.84 # ...of the previous two non-trivial : 0
% 10.81/3.84 # Contextual simplify-reflections : 0
% 10.81/3.84 # Paramodulations : 1
% 10.81/3.84 # Factorizations : 0
% 10.81/3.84 # Equation resolutions : 0
% 10.81/3.84 # Propositional unsat checks : 0
% 10.81/3.84 # Propositional unsat check successes : 0
% 10.81/3.84 # Current number of processed clauses : 10
% 10.81/3.84 # Positive orientable unit clauses : 7
% 10.81/3.84 # Positive unorientable unit clauses: 0
% 10.81/3.84 # Negative unit clauses : 0
% 10.81/3.84 # Non-unit-clauses : 3
% 10.81/3.84 # Current number of unprocessed clauses: 3665
% 10.81/3.84 # ...number of literals in the above : 9766
% 10.81/3.84 # Current number of archived formulas : 0
% 10.81/3.84 # Current number of archived clauses : 0
% 10.81/3.84 # Clause-clause subsumption calls (NU) : 0
% 10.81/3.84 # Rec. Clause-clause subsumption calls : 0
% 10.81/3.84 # Non-unit clause-clause subsumptions : 0
% 10.81/3.84 # Unit Clause-clause subsumption calls : 0
% 10.81/3.84 # Rewrite failures with RHS unbound : 0
% 10.81/3.84 # BW rewrite match attempts : 0
% 10.81/3.84 # BW rewrite match successes : 0
% 10.81/3.84 # Condensation attempts : 0
% 10.81/3.84 # Condensation successes : 0
% 10.81/3.84 # Termbank termtop insertions : 74147
% 10.81/3.84
% 10.81/3.84 # -------------------------------------------------
% 10.81/3.84 # User time : 0.076 s
% 10.81/3.84 # System time : 0.011 s
% 10.81/3.84 # Total time : 0.087 s
% 10.81/3.84 # ...preprocessing : 0.086 s
% 10.81/3.84 # ...main loop : 0.002 s
% 10.81/3.84 # Maximum resident set size: 14644 pages
% 10.81/3.84
%------------------------------------------------------------------------------