TSTP Solution File: CSR112+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR112+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:00 EDT 2022
% Result : Theorem 6.05s 2.67s
% Output : CNFRefutation 6.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 16 unt; 0 nHn; 34 RR)
% Number of literals : 116 ( 0 equ; 93 neg)
% Maximal clause size : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 14 con; 0-3 aty)
% Number of variables : 95 ( 47 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_702,negated_conjecture,
( ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ attr(X4,X5)
| ~ subs(X1,hei__337en_1_1)
| ~ sub(X6,bahn_1_1)
| ~ sub(X5,name_1_1)
| ~ pred(X7,u1_1_1)
| ~ pred(X8,linie_1_1)
| ~ val(X5,u2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_702) ).
cnf(i_0_213,hypothesis,
val(c5920,u2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_213) ).
cnf(i_0_214,hypothesis,
sub(c5920,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_214) ).
cnf(i_0_216,hypothesis,
attr(c5919,c5920),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_216) ).
cnf(i_0_218,hypothesis,
pred(c5910,linie_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_218) ).
cnf(i_0_217,hypothesis,
pred(c5912,u1_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_217) ).
cnf(i_0_219,hypothesis,
sub(c5909,bahn_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_219) ).
cnf(i_0_37,plain,
( subs(esk7_3(X1,X2,X3),hei__337en_1_1)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_37) ).
cnf(i_0_573,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_573) ).
cnf(i_0_572,plain,
member(X1,cons(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_572) ).
cnf(i_0_38,plain,
( arg2(esk7_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_38) ).
cnf(i_0_39,plain,
( arg1(esk7_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ibe5r38m/input.p',i_0_39) ).
cnf(c_0_715,negated_conjecture,
( ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ attr(X4,X5)
| ~ subs(X1,hei__337en_1_1)
| ~ sub(X6,bahn_1_1)
| ~ sub(X5,name_1_1)
| ~ pred(X7,u1_1_1)
| ~ pred(X8,linie_1_1)
| ~ val(X5,u2_0) ),
i_0_702 ).
cnf(c_0_716,hypothesis,
val(c5920,u2_0),
i_0_213 ).
cnf(c_0_717,hypothesis,
sub(c5920,name_1_1),
i_0_214 ).
cnf(c_0_718,hypothesis,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ attr(X4,c5920)
| ~ pred(X5,linie_1_1)
| ~ pred(X6,u1_1_1)
| ~ sub(X7,bahn_1_1)
| ~ subs(X1,hei__337en_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_715,c_0_716]),c_0_717])]) ).
cnf(c_0_719,hypothesis,
attr(c5919,c5920),
i_0_216 ).
cnf(c_0_720,hypothesis,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ pred(X4,linie_1_1)
| ~ pred(X5,u1_1_1)
| ~ sub(X6,bahn_1_1)
| ~ subs(X1,hei__337en_1_1) ),
inference(spm,[status(thm)],[c_0_718,c_0_719]) ).
cnf(c_0_721,hypothesis,
pred(c5910,linie_1_1),
i_0_218 ).
cnf(c_0_722,hypothesis,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ pred(X4,u1_1_1)
| ~ sub(X5,bahn_1_1)
| ~ subs(X1,hei__337en_1_1) ),
inference(spm,[status(thm)],[c_0_720,c_0_721]) ).
cnf(c_0_723,hypothesis,
pred(c5912,u1_1_1),
i_0_217 ).
cnf(c_0_724,hypothesis,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ sub(X4,bahn_1_1)
| ~ subs(X1,hei__337en_1_1) ),
inference(spm,[status(thm)],[c_0_722,c_0_723]) ).
cnf(c_0_725,hypothesis,
sub(c5909,bahn_1_1),
i_0_219 ).
cnf(c_0_726,hypothesis,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ subs(X1,hei__337en_1_1) ),
inference(spm,[status(thm)],[c_0_724,c_0_725]) ).
cnf(c_0_727,plain,
( subs(esk7_3(X1,X2,X3),hei__337en_1_1)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
i_0_37 ).
cnf(c_0_728,plain,
( ~ arg2(esk7_3(X1,X2,X3),X4)
| ~ arg1(esk7_3(X1,X2,X3),X5)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ attr(X3,X1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_726,c_0_727]) ).
cnf(c_0_729,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
i_0_573 ).
cnf(c_0_730,plain,
( ~ arg2(esk7_3(X1,X2,X3),X4)
| ~ arg1(esk7_3(X1,X2,X3),X5)
| ~ member(X2,cons(familiename_1_1,cons(name_1_1,nil)))
| ~ attr(X3,X1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_728,c_0_729]) ).
cnf(c_0_731,plain,
( ~ arg2(esk7_3(X1,X2,X3),X4)
| ~ arg1(esk7_3(X1,X2,X3),X5)
| ~ member(X2,cons(name_1_1,nil))
| ~ attr(X3,X1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_730,c_0_729]) ).
cnf(c_0_732,plain,
member(X1,cons(X1,X2)),
i_0_572 ).
cnf(c_0_733,plain,
( ~ arg2(esk7_3(X1,name_1_1,X2),X3)
| ~ arg1(esk7_3(X1,name_1_1,X2),X4)
| ~ attr(X2,X1)
| ~ sub(X1,name_1_1) ),
inference(spm,[status(thm)],[c_0_731,c_0_732]) ).
cnf(c_0_734,plain,
( arg2(esk7_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
i_0_38 ).
cnf(c_0_735,plain,
( ~ arg1(esk7_3(X1,name_1_1,X2),X3)
| ~ member(name_1_1,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ attr(X2,X1)
| ~ sub(X1,name_1_1) ),
inference(spm,[status(thm)],[c_0_733,c_0_734]) ).
cnf(c_0_736,plain,
( arg1(esk7_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
i_0_39 ).
cnf(c_0_737,plain,
( ~ member(name_1_1,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_735,c_0_736]) ).
cnf(c_0_738,plain,
( ~ member(name_1_1,cons(familiename_1_1,cons(name_1_1,nil)))
| ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_737,c_0_729]) ).
cnf(c_0_739,hypothesis,
~ member(name_1_1,cons(familiename_1_1,cons(name_1_1,nil))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_738,c_0_719]),c_0_717])]) ).
cnf(c_0_740,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_739,c_0_729]),c_0_732])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR112+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Thu Jun 9 19:18:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.36/0.58 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.36/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.36/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.05/2.67 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.05/2.67 # Version: 2.1pre011
% 6.05/2.67 # Preprocessing time : 0.022 s
% 6.05/2.67
% 6.05/2.67 # Proof found!
% 6.05/2.67 # SZS status Theorem
% 6.05/2.67 # SZS output start CNFRefutation
% See solution above
% 6.05/2.67 # Proof object total steps : 38
% 6.05/2.67 # Proof object clause steps : 26
% 6.05/2.67 # Proof object formula steps : 12
% 6.05/2.67 # Proof object conjectures : 2
% 6.05/2.67 # Proof object clause conjectures : 1
% 6.05/2.67 # Proof object formula conjectures : 1
% 6.05/2.67 # Proof object initial clauses used : 12
% 6.05/2.67 # Proof object initial formulas used : 12
% 6.05/2.67 # Proof object generating inferences : 14
% 6.05/2.67 # Proof object simplifying inferences : 6
% 6.05/2.67 # Training examples: 0 positive, 0 negative
% 6.05/2.67 # Parsed axioms : 722
% 6.05/2.67 # Removed by relevancy pruning/SinE : 0
% 6.05/2.67 # Initial clauses : 722
% 6.05/2.67 # Removed in clause preprocessing : 0
% 6.05/2.67 # Initial clauses in saturation : 722
% 6.05/2.67 # Processed clauses : 799
% 6.05/2.67 # ...of these trivial : 0
% 6.05/2.67 # ...subsumed : 0
% 6.05/2.67 # ...remaining for further processing : 799
% 6.05/2.67 # Other redundant clauses eliminated : 0
% 6.05/2.67 # Clauses deleted for lack of memory : 0
% 6.05/2.67 # Backward-subsumed : 18
% 6.05/2.67 # Backward-rewritten : 0
% 6.05/2.67 # Generated clauses : 721
% 6.05/2.67 # ...of the previous two non-trivial : 720
% 6.05/2.67 # Contextual simplify-reflections : 0
% 6.05/2.67 # Paramodulations : 721
% 6.05/2.67 # Factorizations : 0
% 6.05/2.67 # Equation resolutions : 0
% 6.05/2.67 # Propositional unsat checks : 0
% 6.05/2.67 # Propositional unsat check successes : 0
% 6.05/2.67 # Current number of processed clauses : 781
% 6.05/2.67 # Positive orientable unit clauses : 431
% 6.05/2.67 # Positive unorientable unit clauses: 0
% 6.05/2.67 # Negative unit clauses : 3
% 6.05/2.67 # Non-unit-clauses : 347
% 6.05/2.67 # Current number of unprocessed clauses: 631
% 6.05/2.67 # ...number of literals in the above : 2729
% 6.05/2.67 # Current number of archived formulas : 0
% 6.05/2.67 # Current number of archived clauses : 18
% 6.05/2.67 # Clause-clause subsumption calls (NU) : 34796
% 6.05/2.67 # Rec. Clause-clause subsumption calls : 11278
% 6.05/2.67 # Non-unit clause-clause subsumptions : 18
% 6.05/2.67 # Unit Clause-clause subsumption calls : 1226
% 6.05/2.67 # Rewrite failures with RHS unbound : 0
% 6.05/2.67 # BW rewrite match attempts : 0
% 6.05/2.67 # BW rewrite match successes : 0
% 6.05/2.67 # Condensation attempts : 0
% 6.05/2.67 # Condensation successes : 0
% 6.05/2.67 # Termbank termtop insertions : 24678
% 6.05/2.67
% 6.05/2.67 # -------------------------------------------------
% 6.05/2.67 # User time : 0.052 s
% 6.05/2.67 # System time : 0.005 s
% 6.05/2.67 # Total time : 0.057 s
% 6.05/2.67 # ...preprocessing : 0.022 s
% 6.05/2.67 # ...main loop : 0.036 s
% 6.05/2.67 # Maximum resident set size: 8920 pages
% 6.05/2.67
%------------------------------------------------------------------------------