TSTP Solution File: CSR023+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.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:46:34 EDT 2022
% Result : Theorem 7.48s 2.32s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 7 unt; 0 nHn; 22 RR)
% Number of literals : 60 ( 23 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ initiates(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_25) ).
cnf(i_0_93,plain,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_93) ).
cnf(i_0_74,plain,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_74) ).
cnf(i_0_30,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_30) ).
cnf(i_0_96,plain,
( epred1_3(X1,X2,X3)
| X2 != spinning
| X3 != pull
| ~ happens(push,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_96) ).
cnf(i_0_5,plain,
( happens(X1,X2)
| X2 != n2
| X1 != push ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_5) ).
cnf(i_0_6,plain,
( happens(X1,X2)
| X2 != n2
| X1 != pull ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_6) ).
cnf(i_0_81,negated_conjecture,
~ holdsAt(spinning,n3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jfion1tz/input.p',i_0_81) ).
cnf(c_0_105,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ initiates(X3,X1,X2) ),
i_0_25 ).
cnf(c_0_106,plain,
plus(X1,X2) = plus(X2,X1),
i_0_93 ).
cnf(c_0_107,plain,
( holdsAt(X1,plus(n1,X2))
| ~ initiates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_108,plain,
plus(n1,n2) = n3,
i_0_74 ).
cnf(c_0_109,plain,
( holdsAt(X1,n3)
| ~ initiates(X2,X1,n2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_110,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_30 ).
cnf(c_0_111,plain,
( holdsAt(X1,n3)
| ~ epred1_3(n2,X1,X2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_112,plain,
( epred1_3(X1,X2,X3)
| X2 != spinning
| X3 != pull
| ~ happens(push,X1) ),
i_0_96 ).
cnf(c_0_113,plain,
( holdsAt(X1,n3)
| X2 != pull
| X1 != spinning
| ~ happens(push,n2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_114,plain,
( happens(X1,X2)
| X2 != n2
| X1 != push ),
i_0_5 ).
cnf(c_0_115,plain,
( holdsAt(X1,n3)
| X2 != pull
| X1 != spinning
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_116,plain,
( happens(X1,X2)
| X2 != n2
| X1 != pull ),
i_0_6 ).
cnf(c_0_117,plain,
( holdsAt(X1,n3)
| X2 != pull
| X1 != spinning ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_118,negated_conjecture,
~ holdsAt(spinning,n3),
i_0_81 ).
cnf(c_0_119,plain,
( holdsAt(X1,n3)
| X1 != spinning ),
inference(er,[status(thm)],[c_0_117]) ).
cnf(c_0_120,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_118,c_0_119]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n023.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 : Thu Jun 9 19:39:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.48/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.48/2.32 # Version: 2.1pre011
% 7.48/2.32 # Preprocessing time : 0.021 s
% 7.48/2.32
% 7.48/2.32 # Proof found!
% 7.48/2.32 # SZS status Theorem
% 7.48/2.32 # SZS output start CNFRefutation
% See solution above
% 7.48/2.32 # Proof object total steps : 24
% 7.48/2.32 # Proof object clause steps : 16
% 7.48/2.32 # Proof object formula steps : 8
% 7.48/2.32 # Proof object conjectures : 3
% 7.48/2.32 # Proof object clause conjectures : 2
% 7.48/2.32 # Proof object formula conjectures : 1
% 7.48/2.32 # Proof object initial clauses used : 8
% 7.48/2.32 # Proof object initial formulas used : 8
% 7.48/2.32 # Proof object generating inferences : 8
% 7.48/2.32 # Proof object simplifying inferences : 0
% 7.48/2.32 # Training examples: 0 positive, 0 negative
% 7.48/2.32 # Parsed axioms : 177
% 7.48/2.32 # Removed by relevancy pruning/SinE : 0
% 7.48/2.32 # Initial clauses : 177
% 7.48/2.32 # Removed in clause preprocessing : 0
% 7.48/2.32 # Initial clauses in saturation : 177
% 7.48/2.32 # Processed clauses : 506
% 7.48/2.32 # ...of these trivial : 19
% 7.48/2.32 # ...subsumed : 193
% 7.48/2.32 # ...remaining for further processing : 294
% 7.48/2.32 # Other redundant clauses eliminated : 2
% 7.48/2.32 # Clauses deleted for lack of memory : 0
% 7.48/2.32 # Backward-subsumed : 8
% 7.48/2.32 # Backward-rewritten : 2
% 7.48/2.32 # Generated clauses : 779
% 7.48/2.32 # ...of the previous two non-trivial : 630
% 7.48/2.32 # Contextual simplify-reflections : 96
% 7.48/2.32 # Paramodulations : 690
% 7.48/2.32 # Factorizations : 78
% 7.48/2.32 # Equation resolutions : 11
% 7.48/2.32 # Propositional unsat checks : 0
% 7.48/2.32 # Propositional unsat check successes : 0
% 7.48/2.32 # Current number of processed clauses : 282
% 7.48/2.32 # Positive orientable unit clauses : 20
% 7.48/2.32 # Positive unorientable unit clauses: 1
% 7.48/2.32 # Negative unit clauses : 54
% 7.48/2.32 # Non-unit-clauses : 207
% 7.48/2.32 # Current number of unprocessed clauses: 292
% 7.48/2.32 # ...number of literals in the above : 974
% 7.48/2.32 # Current number of archived formulas : 0
% 7.48/2.32 # Current number of archived clauses : 10
% 7.48/2.32 # Clause-clause subsumption calls (NU) : 4317
% 7.48/2.32 # Rec. Clause-clause subsumption calls : 2375
% 7.48/2.32 # Non-unit clause-clause subsumptions : 218
% 7.48/2.32 # Unit Clause-clause subsumption calls : 2276
% 7.48/2.32 # Rewrite failures with RHS unbound : 0
% 7.48/2.32 # BW rewrite match attempts : 34
% 7.48/2.32 # BW rewrite match successes : 24
% 7.48/2.32 # Condensation attempts : 0
% 7.48/2.32 # Condensation successes : 0
% 7.48/2.32 # Termbank termtop insertions : 10353
% 7.48/2.32
% 7.48/2.32 # -------------------------------------------------
% 7.48/2.32 # User time : 0.036 s
% 7.48/2.32 # System time : 0.006 s
% 7.48/2.32 # Total time : 0.042 s
% 7.48/2.32 # ...preprocessing : 0.021 s
% 7.48/2.32 # ...main loop : 0.021 s
% 7.48/2.32 # Maximum resident set size: 7140 pages
% 7.48/2.32
%------------------------------------------------------------------------------