TSTP Solution File: CSR115+82 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+82 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:25 EDT 2022
% Result : Theorem 5.52s 2.66s
% Output : CNFRefutation 5.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 6 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 0 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_637,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X4,name_1_1)
| ~ sub(X6,name_1_1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-utpc9ufc/input.p',i_0_637) ).
cnf(i_0_519,plain,
( attr(X1,esk30_2(X2,X1))
| ~ name(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-utpc9ufc/input.p',i_0_519) ).
cnf(i_0_518,plain,
( sub(esk30_2(X1,X2),name_1_1)
| ~ name(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-utpc9ufc/input.p',i_0_518) ).
cnf(i_0_150,hypothesis,
name(c358,freeride_____344ra_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-utpc9ufc/input.p',i_0_150) ).
cnf(i_0_154,hypothesis,
attr(c341,c342),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-utpc9ufc/input.p',i_0_154) ).
cnf(c_0_643,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X4,name_1_1)
| ~ sub(X6,name_1_1) ),
i_0_637 ).
cnf(c_0_644,plain,
( attr(X1,esk30_2(X2,X1))
| ~ name(X1,X2) ),
i_0_519 ).
cnf(c_0_645,plain,
( sub(esk30_2(X1,X2),name_1_1)
| ~ name(X2,X1) ),
i_0_518 ).
cnf(c_0_646,negated_conjecture,
( ~ name(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X4,name_1_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_643,c_0_644]),c_0_645]) ).
cnf(c_0_647,hypothesis,
name(c358,freeride_____344ra_0),
i_0_150 ).
cnf(c_0_648,hypothesis,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_646,c_0_647]) ).
cnf(c_0_649,plain,
( ~ name(X1,X2)
| ~ attr(X3,X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_648,c_0_644]),c_0_645]) ).
cnf(c_0_650,hypothesis,
attr(c341,c342),
i_0_154 ).
cnf(c_0_651,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_649,c_0_647]) ).
cnf(c_0_652,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_650,c_0_651]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR115+82 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Fri Jun 10 23:41:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.39/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.52/2.66 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 5.52/2.66 # Version: 2.1pre011
% 5.52/2.66 # Preprocessing time : 0.036 s
% 5.52/2.66
% 5.52/2.66 # Proof found!
% 5.52/2.66 # SZS status Theorem
% 5.52/2.66 # SZS output start CNFRefutation
% See solution above
% 5.52/2.66 # Proof object total steps : 15
% 5.52/2.67 # Proof object clause steps : 10
% 5.52/2.67 # Proof object formula steps : 5
% 5.52/2.67 # Proof object conjectures : 3
% 5.52/2.67 # Proof object clause conjectures : 2
% 5.52/2.67 # Proof object formula conjectures : 1
% 5.52/2.67 # Proof object initial clauses used : 5
% 5.52/2.67 # Proof object initial formulas used : 5
% 5.52/2.67 # Proof object generating inferences : 4
% 5.52/2.67 # Proof object simplifying inferences : 3
% 5.52/2.67 # Training examples: 0 positive, 0 negative
% 5.52/2.67 # Parsed axioms : 657
% 5.52/2.67 # Removed by relevancy pruning/SinE : 0
% 5.52/2.67 # Initial clauses : 657
% 5.52/2.67 # Removed in clause preprocessing : 0
% 5.52/2.67 # Initial clauses in saturation : 657
% 5.52/2.67 # Processed clauses : 678
% 5.52/2.67 # ...of these trivial : 0
% 5.52/2.67 # ...subsumed : 3
% 5.52/2.67 # ...remaining for further processing : 675
% 5.52/2.67 # Other redundant clauses eliminated : 0
% 5.52/2.67 # Clauses deleted for lack of memory : 0
% 5.52/2.67 # Backward-subsumed : 3
% 5.52/2.67 # Backward-rewritten : 0
% 5.52/2.67 # Generated clauses : 1633
% 5.52/2.67 # ...of the previous two non-trivial : 1628
% 5.52/2.67 # Contextual simplify-reflections : 2
% 5.52/2.67 # Paramodulations : 1632
% 5.52/2.67 # Factorizations : 0
% 5.52/2.67 # Equation resolutions : 0
% 5.52/2.67 # Propositional unsat checks : 0
% 5.52/2.67 # Propositional unsat check successes : 0
% 5.52/2.67 # Current number of processed clauses : 671
% 5.52/2.67 # Positive orientable unit clauses : 351
% 5.52/2.67 # Positive unorientable unit clauses: 0
% 5.52/2.67 # Negative unit clauses : 2
% 5.52/2.67 # Non-unit-clauses : 318
% 5.52/2.67 # Current number of unprocessed clauses: 1600
% 5.52/2.67 # ...number of literals in the above : 5078
% 5.52/2.67 # Current number of archived formulas : 0
% 5.52/2.67 # Current number of archived clauses : 4
% 5.52/2.67 # Clause-clause subsumption calls (NU) : 23709
% 5.52/2.67 # Rec. Clause-clause subsumption calls : 7708
% 5.52/2.67 # Non-unit clause-clause subsumptions : 5
% 5.52/2.67 # Unit Clause-clause subsumption calls : 2532
% 5.52/2.67 # Rewrite failures with RHS unbound : 0
% 5.52/2.67 # BW rewrite match attempts : 0
% 5.52/2.67 # BW rewrite match successes : 0
% 5.52/2.67 # Condensation attempts : 0
% 5.52/2.67 # Condensation successes : 0
% 5.52/2.67 # Termbank termtop insertions : 31302
% 5.52/2.67
% 5.52/2.67 # -------------------------------------------------
% 5.52/2.67 # User time : 0.070 s
% 5.52/2.67 # System time : 0.007 s
% 5.52/2.67 # Total time : 0.077 s
% 5.52/2.67 # ...preprocessing : 0.036 s
% 5.52/2.67 # ...main loop : 0.041 s
% 5.52/2.67 # Maximum resident set size: 8920 pages
% 5.52/2.67
%------------------------------------------------------------------------------