TSTP Solution File: CSR115+30 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+30 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:15 EDT 2022
% Result : Theorem 8.28s 2.77s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 42 ( 0 equ; 31 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 42 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_665,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ val(X2,X7)
| ~ sub(X2,jahr__1_1)
| ~ has_card_leq(X7,int1994) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_665) ).
cnf(i_0_487,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_487) ).
cnf(i_0_76,hypothesis,
card(c74,int1994),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_76) ).
cnf(i_0_178,hypothesis,
val(c79,c74),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_178) ).
cnf(i_0_179,hypothesis,
sub(c79,jahr__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_179) ).
cnf(i_0_180,hypothesis,
attr(c78,c79),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-99e84lj1/input.p',i_0_180) ).
cnf(c_0_672,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ val(X2,X7)
| ~ sub(X2,jahr__1_1)
| ~ has_card_leq(X7,int1994) ),
i_0_665 ).
cnf(c_0_673,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_487 ).
cnf(c_0_674,plain,
( ~ card(X1,int1994)
| ~ val(X2,X1)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X7,X2)
| ~ sub(X2,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_672,c_0_673]) ).
cnf(c_0_675,hypothesis,
card(c74,int1994),
i_0_76 ).
cnf(c_0_676,hypothesis,
( ~ val(X1,c74)
| ~ attr(X2,X3)
| ~ attr(X4,X5)
| ~ attr(X6,X1)
| ~ sub(X1,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_674,c_0_675]) ).
cnf(c_0_677,hypothesis,
val(c79,c74),
i_0_178 ).
cnf(c_0_678,hypothesis,
sub(c79,jahr__1_1),
i_0_179 ).
cnf(c_0_679,hypothesis,
( ~ attr(X1,c79)
| ~ attr(X2,X3)
| ~ attr(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_676,c_0_677]),c_0_678])]) ).
cnf(c_0_680,hypothesis,
attr(c78,c79),
i_0_180 ).
cnf(c_0_681,hypothesis,
( ~ attr(X1,X2)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_679,c_0_680]) ).
cnf(c_0_682,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_681,c_0_680]) ).
cnf(c_0_683,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_680,c_0_682]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR115+30 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 10 03:50:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.43/0.61 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.28/2.77 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.28/2.77 # Version: 2.1pre011
% 8.28/2.77 # Preprocessing time : 0.020 s
% 8.28/2.77
% 8.28/2.77 # Proof found!
% 8.28/2.77 # SZS status Theorem
% 8.28/2.77 # SZS output start CNFRefutation
% See solution above
% 8.28/2.77 # Proof object total steps : 18
% 8.28/2.77 # Proof object clause steps : 12
% 8.28/2.77 # Proof object formula steps : 6
% 8.28/2.77 # Proof object conjectures : 2
% 8.28/2.77 # Proof object clause conjectures : 1
% 8.28/2.77 # Proof object formula conjectures : 1
% 8.28/2.77 # Proof object initial clauses used : 6
% 8.28/2.77 # Proof object initial formulas used : 6
% 8.28/2.77 # Proof object generating inferences : 5
% 8.28/2.77 # Proof object simplifying inferences : 3
% 8.28/2.77 # Training examples: 0 positive, 0 negative
% 8.28/2.77 # Parsed axioms : 685
% 8.28/2.77 # Removed by relevancy pruning/SinE : 0
% 8.28/2.77 # Initial clauses : 685
% 8.28/2.77 # Removed in clause preprocessing : 0
% 8.28/2.77 # Initial clauses in saturation : 685
% 8.28/2.77 # Processed clauses : 694
% 8.28/2.77 # ...of these trivial : 0
% 8.28/2.77 # ...subsumed : 0
% 8.28/2.77 # ...remaining for further processing : 694
% 8.28/2.77 # Other redundant clauses eliminated : 0
% 8.28/2.77 # Clauses deleted for lack of memory : 0
% 8.28/2.77 # Backward-subsumed : 4
% 8.28/2.77 # Backward-rewritten : 0
% 8.28/2.77 # Generated clauses : 636
% 8.28/2.77 # ...of the previous two non-trivial : 631
% 8.28/2.77 # Contextual simplify-reflections : 0
% 8.28/2.77 # Paramodulations : 635
% 8.28/2.77 # Factorizations : 0
% 8.28/2.77 # Equation resolutions : 0
% 8.28/2.77 # Propositional unsat checks : 0
% 8.28/2.77 # Propositional unsat check successes : 0
% 8.28/2.77 # Current number of processed clauses : 689
% 8.28/2.77 # Positive orientable unit clauses : 378
% 8.28/2.77 # Positive unorientable unit clauses: 0
% 8.28/2.77 # Negative unit clauses : 1
% 8.28/2.77 # Non-unit-clauses : 310
% 8.28/2.77 # Current number of unprocessed clauses: 618
% 8.28/2.77 # ...number of literals in the above : 2646
% 8.28/2.77 # Current number of archived formulas : 0
% 8.28/2.77 # Current number of archived clauses : 5
% 8.28/2.77 # Clause-clause subsumption calls (NU) : 30725
% 8.28/2.77 # Rec. Clause-clause subsumption calls : 10428
% 8.28/2.77 # Non-unit clause-clause subsumptions : 4
% 8.28/2.77 # Unit Clause-clause subsumption calls : 615
% 8.28/2.77 # Rewrite failures with RHS unbound : 0
% 8.28/2.77 # BW rewrite match attempts : 0
% 8.28/2.77 # BW rewrite match successes : 0
% 8.28/2.77 # Condensation attempts : 0
% 8.28/2.77 # Condensation successes : 0
% 8.28/2.77 # Termbank termtop insertions : 22583
% 8.28/2.77
% 8.28/2.77 # -------------------------------------------------
% 8.28/2.77 # User time : 0.044 s
% 8.28/2.77 # System time : 0.005 s
% 8.28/2.77 # Total time : 0.048 s
% 8.28/2.77 # ...preprocessing : 0.020 s
% 8.28/2.77 # ...main loop : 0.028 s
% 8.28/2.77 # Maximum resident set size: 8388 pages
% 8.28/2.77
%------------------------------------------------------------------------------