TSTP Solution File: CSR231+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR231+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:50:01 EDT 2022
% Result : Theorem 27.75s 6.43s
% Output : CNFRefutation 27.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 18 unt; 0 nHn; 29 RR)
% Number of literals : 43 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3379,plain,
( p__d__subclass(X1,X2)
| ~ p__d__subclass(X3,X2)
| ~ p__d__subclass(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_3379) ).
cnf(i_0_728,plain,
p__d__subclass(c__Translocation,c__Motion),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_728) ).
cnf(i_0_681,plain,
p__d__subclass(c__Transfer,c__Translocation),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_681) ).
cnf(i_0_696,plain,
p__d__subclass(c__Putting,c__Transfer),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_696) ).
cnf(i_0_697,plain,
p__d__subclass(c__Covering,c__Putting),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_697) ).
cnf(i_0_3225,plain,
p__d__subclass(c__Painting,c__Covering),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_3225) ).
cnf(i_0_1,negated_conjecture,
( ~ p__d__subclass(X1,c__ContentDevelopment)
| ~ p__d__subclass(X1,c__Motion) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_1) ).
cnf(i_0_3235,plain,
p__d__subclass(c__ArtPainting,c__ContentDevelopment),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_3235) ).
cnf(i_0_3236,plain,
p__d__subclass(c__ArtPainting,c__Painting),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dyba024j/input.p',i_0_3236) ).
cnf(c_0_3389,plain,
( p__d__subclass(X1,X2)
| ~ p__d__subclass(X3,X2)
| ~ p__d__subclass(X1,X3) ),
i_0_3379 ).
cnf(c_0_3390,plain,
p__d__subclass(c__Translocation,c__Motion),
i_0_728 ).
cnf(c_0_3391,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X1,c__Translocation) ),
inference(spm,[status(thm)],[c_0_3389,c_0_3390]) ).
cnf(c_0_3392,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X2,c__Translocation)
| ~ p__d__subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_3389,c_0_3391]) ).
cnf(c_0_3393,plain,
p__d__subclass(c__Transfer,c__Translocation),
i_0_681 ).
cnf(c_0_3394,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X1,c__Transfer) ),
inference(spm,[status(thm)],[c_0_3392,c_0_3393]) ).
cnf(c_0_3395,plain,
p__d__subclass(c__Putting,c__Transfer),
i_0_696 ).
cnf(c_0_3396,plain,
p__d__subclass(c__Putting,c__Motion),
inference(spm,[status(thm)],[c_0_3394,c_0_3395]) ).
cnf(c_0_3397,plain,
p__d__subclass(c__Covering,c__Putting),
i_0_697 ).
cnf(c_0_3398,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X1,c__Putting) ),
inference(spm,[status(thm)],[c_0_3389,c_0_3396]) ).
cnf(c_0_3399,plain,
( p__d__subclass(X1,c__Putting)
| ~ p__d__subclass(X1,c__Covering) ),
inference(spm,[status(thm)],[c_0_3389,c_0_3397]) ).
cnf(c_0_3400,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X1,c__Covering) ),
inference(spm,[status(thm)],[c_0_3398,c_0_3399]) ).
cnf(c_0_3401,plain,
p__d__subclass(c__Painting,c__Covering),
i_0_3225 ).
cnf(c_0_3402,plain,
p__d__subclass(c__Painting,c__Motion),
inference(spm,[status(thm)],[c_0_3400,c_0_3401]) ).
cnf(c_0_3403,negated_conjecture,
( ~ p__d__subclass(X1,c__ContentDevelopment)
| ~ p__d__subclass(X1,c__Motion) ),
i_0_1 ).
cnf(c_0_3404,plain,
p__d__subclass(c__ArtPainting,c__ContentDevelopment),
i_0_3235 ).
cnf(c_0_3405,plain,
( p__d__subclass(X1,c__Motion)
| ~ p__d__subclass(X1,c__Painting) ),
inference(spm,[status(thm)],[c_0_3389,c_0_3402]) ).
cnf(c_0_3406,plain,
p__d__subclass(c__ArtPainting,c__Painting),
i_0_3236 ).
cnf(c_0_3407,negated_conjecture,
~ p__d__subclass(c__ArtPainting,c__Motion),
inference(spm,[status(thm)],[c_0_3403,c_0_3404]) ).
cnf(c_0_3408,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3405,c_0_3406]),c_0_3407]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR231+1 : TPTP v8.1.0. Released v7.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jun 10 16:20:21 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.42/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 27.75/6.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 27.75/6.43 # Version: 2.1pre011
% 27.75/6.43 # Preprocessing time : 0.123 s
% 27.75/6.43
% 27.75/6.43 # Proof found!
% 27.75/6.43 # SZS status Theorem
% 27.75/6.43 # SZS output start CNFRefutation
% See solution above
% 27.75/6.43 # Proof object total steps : 29
% 27.75/6.43 # Proof object clause steps : 20
% 27.75/6.43 # Proof object formula steps : 9
% 27.75/6.43 # Proof object conjectures : 3
% 27.75/6.43 # Proof object clause conjectures : 2
% 27.75/6.43 # Proof object formula conjectures : 1
% 27.75/6.43 # Proof object initial clauses used : 9
% 27.75/6.43 # Proof object initial formulas used : 9
% 27.75/6.43 # Proof object generating inferences : 11
% 27.75/6.43 # Proof object simplifying inferences : 1
% 27.75/6.43 # Training examples: 0 positive, 0 negative
% 27.75/6.43 # Parsed axioms : 4155
% 27.75/6.43 # Removed by relevancy pruning/SinE : 0
% 27.75/6.43 # Initial clauses : 4155
% 27.75/6.43 # Removed in clause preprocessing : 0
% 27.75/6.43 # Initial clauses in saturation : 4155
% 27.75/6.43 # Processed clauses : 6769
% 27.75/6.43 # ...of these trivial : 48
% 27.75/6.43 # ...subsumed : 63
% 27.75/6.43 # ...remaining for further processing : 6658
% 27.75/6.43 # Other redundant clauses eliminated : 9
% 27.75/6.43 # Clauses deleted for lack of memory : 0
% 27.75/6.43 # Backward-subsumed : 25
% 27.75/6.43 # Backward-rewritten : 2
% 27.75/6.43 # Generated clauses : 19745
% 27.75/6.43 # ...of the previous two non-trivial : 18673
% 27.75/6.43 # Contextual simplify-reflections : 1544
% 27.75/6.43 # Paramodulations : 19676
% 27.75/6.43 # Factorizations : 47
% 27.75/6.43 # Equation resolutions : 22
% 27.75/6.43 # Propositional unsat checks : 1
% 27.75/6.43 # Propositional unsat check successes : 0
% 27.75/6.43 # Current number of processed clauses : 6628
% 27.75/6.43 # Positive orientable unit clauses : 1635
% 27.75/6.43 # Positive unorientable unit clauses: 0
% 27.75/6.43 # Negative unit clauses : 36
% 27.75/6.43 # Non-unit-clauses : 4957
% 27.75/6.43 # Current number of unprocessed clauses: 16056
% 27.75/6.43 # ...number of literals in the above : 68339
% 27.75/6.43 # Current number of archived formulas : 0
% 27.75/6.43 # Current number of archived clauses : 27
% 27.75/6.43 # Clause-clause subsumption calls (NU) : 6322287
% 27.75/6.43 # Rec. Clause-clause subsumption calls : 2738846
% 27.75/6.43 # Non-unit clause-clause subsumptions : 1632
% 27.75/6.43 # Unit Clause-clause subsumption calls : 269629
% 27.75/6.43 # Rewrite failures with RHS unbound : 0
% 27.75/6.43 # BW rewrite match attempts : 6
% 27.75/6.43 # BW rewrite match successes : 2
% 27.75/6.43 # Condensation attempts : 0
% 27.75/6.43 # Condensation successes : 0
% 27.75/6.43 # Termbank termtop insertions : 479218
% 27.75/6.43
% 27.75/6.43 # -------------------------------------------------
% 27.75/6.43 # User time : 1.701 s
% 27.75/6.43 # System time : 0.032 s
% 27.75/6.43 # Total time : 1.733 s
% 27.75/6.43 # ...preprocessing : 0.123 s
% 27.75/6.43 # ...main loop : 1.611 s
% 27.75/6.43 # Maximum resident set size: 59252 pages
% 27.75/6.43
%------------------------------------------------------------------------------