TSTP Solution File: CSR115+65 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+65 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:49:22 EDT 2022
% Result : Theorem 11.32s 3.38s
% Output : CNFRefutation 11.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 6 unt; 0 nHn; 22 RR)
% Number of literals : 60 ( 0 equ; 47 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_862,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_862) ).
cnf(i_0_841,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_841) ).
cnf(i_0_858,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_858) ).
cnf(i_0_859,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_859) ).
cnf(i_0_860,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_860) ).
cnf(i_0_368,hypothesis,
attr(c34925,c34926),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_368) ).
cnf(i_0_367,hypothesis,
sub(c34925,mensch_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t30qarjp/input.p',i_0_367) ).
cnf(c_0_870,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7) ),
i_0_862 ).
cnf(c_0_871,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_841 ).
cnf(c_0_872,negated_conjecture,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ subr(X1,sub_0)
| ~ attr(X4,X5)
| ~ attr(X6,X7)
| ~ attr(X3,X8) ),
inference(spm,[status(thm)],[c_0_870,c_0_871]) ).
cnf(c_0_873,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_858 ).
cnf(c_0_874,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),X4)
| ~ attr(X5,X6)
| ~ attr(X7,X8)
| ~ attr(X4,X9)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_872,c_0_873]) ).
cnf(c_0_875,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_859 ).
cnf(c_0_876,plain,
( ~ arg1(esk59_2(X1,X2),X3)
| ~ attr(X4,X5)
| ~ attr(X6,X7)
| ~ attr(X3,X8)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_874,c_0_875]) ).
cnf(c_0_877,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_860 ).
cnf(c_0_878,plain,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X5,X7) ),
inference(spm,[status(thm)],[c_0_876,c_0_877]) ).
cnf(c_0_879,hypothesis,
attr(c34925,c34926),
i_0_368 ).
cnf(c_0_880,hypothesis,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X3,X5) ),
inference(spm,[status(thm)],[c_0_878,c_0_879]) ).
cnf(c_0_881,hypothesis,
( ~ attr(X1,X2)
| ~ sub(X1,X3) ),
inference(spm,[status(thm)],[c_0_880,c_0_879]) ).
cnf(c_0_882,hypothesis,
sub(c34925,mensch_1_1),
i_0_367 ).
cnf(c_0_883,hypothesis,
~ sub(c34925,X1),
inference(spm,[status(thm)],[c_0_881,c_0_879]) ).
cnf(c_0_884,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_882,c_0_883]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR115+65 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Fri Jun 10 02:39:08 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.36/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.36/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.36/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.32/3.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.32/3.38 # Version: 2.1pre011
% 11.32/3.38 # Preprocessing time : 0.024 s
% 11.32/3.38
% 11.32/3.38 # Proof found!
% 11.32/3.38 # SZS status Theorem
% 11.32/3.38 # SZS output start CNFRefutation
% See solution above
% 11.32/3.38 # Proof object total steps : 22
% 11.32/3.38 # Proof object clause steps : 15
% 11.32/3.38 # Proof object formula steps : 7
% 11.32/3.38 # Proof object conjectures : 3
% 11.32/3.38 # Proof object clause conjectures : 2
% 11.32/3.38 # Proof object formula conjectures : 1
% 11.32/3.38 # Proof object initial clauses used : 7
% 11.32/3.38 # Proof object initial formulas used : 7
% 11.32/3.38 # Proof object generating inferences : 7
% 11.32/3.38 # Proof object simplifying inferences : 1
% 11.32/3.38 # Training examples: 0 positive, 0 negative
% 11.32/3.38 # Parsed axioms : 882
% 11.32/3.38 # Removed by relevancy pruning/SinE : 0
% 11.32/3.38 # Initial clauses : 882
% 11.32/3.38 # Removed in clause preprocessing : 0
% 11.32/3.38 # Initial clauses in saturation : 882
% 11.32/3.38 # Processed clauses : 1030
% 11.32/3.38 # ...of these trivial : 0
% 11.32/3.38 # ...subsumed : 6
% 11.32/3.38 # ...remaining for further processing : 1024
% 11.32/3.38 # Other redundant clauses eliminated : 0
% 11.32/3.38 # Clauses deleted for lack of memory : 0
% 11.32/3.38 # Backward-subsumed : 13
% 11.32/3.38 # Backward-rewritten : 0
% 11.32/3.38 # Generated clauses : 1947
% 11.32/3.38 # ...of the previous two non-trivial : 1939
% 11.32/3.38 # Contextual simplify-reflections : 7
% 11.32/3.38 # Paramodulations : 1946
% 11.32/3.38 # Factorizations : 0
% 11.32/3.38 # Equation resolutions : 0
% 11.32/3.38 # Propositional unsat checks : 0
% 11.32/3.38 # Propositional unsat check successes : 0
% 11.32/3.38 # Current number of processed clauses : 1010
% 11.32/3.38 # Positive orientable unit clauses : 622
% 11.32/3.38 # Positive unorientable unit clauses: 0
% 11.32/3.38 # Negative unit clauses : 5
% 11.32/3.38 # Non-unit-clauses : 383
% 11.32/3.38 # Current number of unprocessed clauses: 1738
% 11.32/3.38 # ...number of literals in the above : 5865
% 11.32/3.38 # Current number of archived formulas : 0
% 11.32/3.38 # Current number of archived clauses : 14
% 11.32/3.38 # Clause-clause subsumption calls (NU) : 35735
% 11.32/3.38 # Rec. Clause-clause subsumption calls : 9509
% 11.32/3.38 # Non-unit clause-clause subsumptions : 26
% 11.32/3.38 # Unit Clause-clause subsumption calls : 3254
% 11.32/3.38 # Rewrite failures with RHS unbound : 0
% 11.32/3.38 # BW rewrite match attempts : 2
% 11.32/3.38 # BW rewrite match successes : 0
% 11.32/3.38 # Condensation attempts : 0
% 11.32/3.38 # Condensation successes : 0
% 11.32/3.38 # Termbank termtop insertions : 37791
% 11.32/3.38
% 11.32/3.38 # -------------------------------------------------
% 11.32/3.38 # User time : 0.077 s
% 11.32/3.38 # System time : 0.006 s
% 11.32/3.38 # Total time : 0.083 s
% 11.32/3.38 # ...preprocessing : 0.024 s
% 11.32/3.38 # ...main loop : 0.059 s
% 11.32/3.38 # Maximum resident set size: 10764 pages
% 11.32/3.38
%------------------------------------------------------------------------------