TSTP Solution File: CSR083+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR083+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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.22s 3.47s
% Output : CNFRefutation 10.22s
% 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_2927,negated_conjecture,
( X1 != s__Human
| ~ s__subclass(X1,s__CognitiveAgent)
| ~ s__subclass(X1,s__Animal) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6g2mo0cx/input.p',i_0_2927) ).
cnf(i_0_2560,plain,
s__subclass(s__Human,s__Animal),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6g2mo0cx/input.p',i_0_2560) ).
cnf(i_0_1497,plain,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6g2mo0cx/input.p',i_0_1497) ).
cnf(c_0_2931,negated_conjecture,
( X1 != s__Human
| ~ s__subclass(X1,s__CognitiveAgent)
| ~ s__subclass(X1,s__Animal) ),
i_0_2927 ).
cnf(c_0_2932,plain,
s__subclass(s__Human,s__Animal),
i_0_2560 ).
cnf(c_0_2933,plain,
s__subclass(s__Human,s__CognitiveAgent),
i_0_1497 ).
cnf(c_0_2934,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2931,c_0_2932]),c_0_2933])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR083+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 03:45:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.46/0.64 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.64 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.46/0.64 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.46/0.64 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.22/3.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.22/3.47 # Version: 2.1pre011
% 10.22/3.47 # Preprocessing time : 0.086 s
% 10.22/3.47
% 10.22/3.47 # Proof found!
% 10.22/3.47 # SZS status Theorem
% 10.22/3.47 # SZS output start CNFRefutation
% See solution above
% 10.22/3.47 # Proof object total steps : 7
% 10.22/3.47 # Proof object clause steps : 4
% 10.22/3.47 # Proof object formula steps : 3
% 10.22/3.47 # Proof object conjectures : 3
% 10.22/3.47 # Proof object clause conjectures : 2
% 10.22/3.47 # Proof object formula conjectures : 1
% 10.22/3.47 # Proof object initial clauses used : 3
% 10.22/3.47 # Proof object initial formulas used : 3
% 10.22/3.47 # Proof object generating inferences : 1
% 10.22/3.47 # Proof object simplifying inferences : 2
% 10.22/3.47 # Training examples: 0 positive, 0 negative
% 10.22/3.47 # Parsed axioms : 2893
% 10.22/3.47 # Removed by relevancy pruning/SinE : 0
% 10.22/3.47 # Initial clauses : 2893
% 10.22/3.47 # Removed in clause preprocessing : 0
% 10.22/3.47 # Initial clauses in saturation : 2893
% 10.22/3.47 # Processed clauses : 10
% 10.22/3.47 # ...of these trivial : 0
% 10.22/3.47 # ...subsumed : 0
% 10.22/3.47 # ...remaining for further processing : 10
% 10.22/3.47 # Other redundant clauses eliminated : 0
% 10.22/3.47 # Clauses deleted for lack of memory : 0
% 10.22/3.47 # Backward-subsumed : 0
% 10.22/3.47 # Backward-rewritten : 0
% 10.22/3.47 # Generated clauses : 1
% 10.22/3.47 # ...of the previous two non-trivial : 0
% 10.22/3.47 # Contextual simplify-reflections : 0
% 10.22/3.47 # Paramodulations : 1
% 10.22/3.47 # Factorizations : 0
% 10.22/3.47 # Equation resolutions : 0
% 10.22/3.47 # Propositional unsat checks : 0
% 10.22/3.47 # Propositional unsat check successes : 0
% 10.22/3.47 # Current number of processed clauses : 10
% 10.22/3.47 # Positive orientable unit clauses : 8
% 10.22/3.47 # Positive unorientable unit clauses: 0
% 10.22/3.47 # Negative unit clauses : 0
% 10.22/3.47 # Non-unit-clauses : 2
% 10.22/3.47 # Current number of unprocessed clauses: 2883
% 10.22/3.47 # ...number of literals in the above : 7653
% 10.22/3.47 # Current number of archived formulas : 0
% 10.22/3.47 # Current number of archived clauses : 0
% 10.22/3.47 # Clause-clause subsumption calls (NU) : 0
% 10.22/3.47 # Rec. Clause-clause subsumption calls : 0
% 10.22/3.47 # Non-unit clause-clause subsumptions : 0
% 10.22/3.47 # Unit Clause-clause subsumption calls : 0
% 10.22/3.47 # Rewrite failures with RHS unbound : 0
% 10.22/3.47 # BW rewrite match attempts : 0
% 10.22/3.47 # BW rewrite match successes : 0
% 10.22/3.47 # Condensation attempts : 0
% 10.22/3.47 # Condensation successes : 0
% 10.22/3.47 # Termbank termtop insertions : 57671
% 10.22/3.47
% 10.22/3.47 # -------------------------------------------------
% 10.22/3.47 # User time : 0.079 s
% 10.22/3.47 # System time : 0.009 s
% 10.22/3.47 # Total time : 0.088 s
% 10.22/3.47 # ...preprocessing : 0.086 s
% 10.22/3.47 # ...main loop : 0.002 s
% 10.22/3.47 # Maximum resident set size: 11744 pages
% 10.22/3.47
%------------------------------------------------------------------------------