TSTP Solution File: CSR115+76 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+76 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:24 EDT 2022
% Result : Theorem 7.79s 2.53s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 17 unt; 0 nHn; 24 RR)
% Number of literals : 67 ( 0 equ; 50 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_736,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ temp(X1,X3)
| ~ sub(X4,jahr__1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_736) ).
cnf(i_0_246,hypothesis,
val(c402,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_246) ).
cnf(i_0_247,hypothesis,
sub(c402,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_247) ).
cnf(i_0_250,hypothesis,
attr(c401,c402),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_250) ).
cnf(i_0_248,hypothesis,
sub(c401,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_248) ).
cnf(i_0_240,hypothesis,
temp(c410,c490),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_240) ).
cnf(i_0_245,hypothesis,
agt(c410,c401),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_245) ).
cnf(i_0_239,hypothesis,
attr(c490,c491),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_239) ).
cnf(i_0_238,hypothesis,
sub(c491,jahr__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-le21kuaq/input.p',i_0_238) ).
cnf(c_0_746,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ temp(X1,X3)
| ~ sub(X4,jahr__1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
i_0_736 ).
cnf(c_0_747,hypothesis,
val(c402,bmw_0),
i_0_246 ).
cnf(c_0_748,hypothesis,
sub(c402,name_1_1),
i_0_247 ).
cnf(c_0_749,negated_conjecture,
( ~ temp(X1,X2)
| ~ val(X3,bmw_0)
| ~ attr(X4,c402)
| ~ attr(X5,X3)
| ~ attr(X2,X6)
| ~ agt(X1,X4)
| ~ sub(X3,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ sub(X6,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_746,c_0_747]),c_0_748])]) ).
cnf(c_0_750,hypothesis,
( ~ temp(X1,X2)
| ~ attr(X3,c402)
| ~ attr(X4,c402)
| ~ attr(X2,X5)
| ~ agt(X1,X3)
| ~ sub(X4,firma_1_1)
| ~ sub(X5,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_749,c_0_747]),c_0_748])]) ).
cnf(c_0_751,hypothesis,
attr(c401,c402),
i_0_250 ).
cnf(c_0_752,hypothesis,
( ~ temp(X1,X2)
| ~ attr(X3,c402)
| ~ attr(X2,X4)
| ~ agt(X1,c401)
| ~ sub(X3,firma_1_1)
| ~ sub(X4,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_750,c_0_751]) ).
cnf(c_0_753,hypothesis,
sub(c401,firma_1_1),
i_0_248 ).
cnf(c_0_754,hypothesis,
( ~ temp(X1,X2)
| ~ attr(X2,X3)
| ~ agt(X1,c401)
| ~ sub(X3,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_752,c_0_751]),c_0_753])]) ).
cnf(c_0_755,hypothesis,
temp(c410,c490),
i_0_240 ).
cnf(c_0_756,hypothesis,
agt(c410,c401),
i_0_245 ).
cnf(c_0_757,hypothesis,
( ~ attr(c490,X1)
| ~ sub(X1,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_754,c_0_755]),c_0_756])]) ).
cnf(c_0_758,hypothesis,
attr(c490,c491),
i_0_239 ).
cnf(c_0_759,hypothesis,
sub(c491,jahr__1_1),
i_0_238 ).
cnf(c_0_760,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_757,c_0_758]),c_0_759])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR115+76 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 10 19:01:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.41/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.79/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.79/2.53 # Version: 2.1pre011
% 7.79/2.53 # Preprocessing time : 0.020 s
% 7.79/2.53
% 7.79/2.53 # Proof found!
% 7.79/2.53 # SZS status Theorem
% 7.79/2.53 # SZS output start CNFRefutation
% See solution above
% 7.79/2.53 # Proof object total steps : 24
% 7.79/2.53 # Proof object clause steps : 15
% 7.79/2.53 # Proof object formula steps : 9
% 7.79/2.53 # Proof object conjectures : 3
% 7.79/2.53 # Proof object clause conjectures : 2
% 7.79/2.53 # Proof object formula conjectures : 1
% 7.79/2.53 # Proof object initial clauses used : 9
% 7.79/2.53 # Proof object initial formulas used : 9
% 7.79/2.53 # Proof object generating inferences : 6
% 7.79/2.53 # Proof object simplifying inferences : 10
% 7.79/2.53 # Training examples: 0 positive, 0 negative
% 7.79/2.53 # Parsed axioms : 756
% 7.79/2.53 # Removed by relevancy pruning/SinE : 0
% 7.79/2.53 # Initial clauses : 756
% 7.79/2.53 # Removed in clause preprocessing : 0
% 7.79/2.53 # Initial clauses in saturation : 756
% 7.79/2.53 # Processed clauses : 774
% 7.79/2.53 # ...of these trivial : 0
% 7.79/2.53 # ...subsumed : 0
% 7.79/2.53 # ...remaining for further processing : 774
% 7.79/2.53 # Other redundant clauses eliminated : 0
% 7.79/2.53 # Clauses deleted for lack of memory : 0
% 7.79/2.53 # Backward-subsumed : 1
% 7.79/2.53 # Backward-rewritten : 0
% 7.79/2.53 # Generated clauses : 1741
% 7.79/2.53 # ...of the previous two non-trivial : 1740
% 7.79/2.53 # Contextual simplify-reflections : 1
% 7.79/2.53 # Paramodulations : 1741
% 7.79/2.53 # Factorizations : 0
% 7.79/2.53 # Equation resolutions : 0
% 7.79/2.53 # Propositional unsat checks : 0
% 7.79/2.53 # Propositional unsat check successes : 0
% 7.79/2.53 # Current number of processed clauses : 773
% 7.79/2.53 # Positive orientable unit clauses : 451
% 7.79/2.53 # Positive unorientable unit clauses: 0
% 7.79/2.53 # Negative unit clauses : 0
% 7.79/2.53 # Non-unit-clauses : 322
% 7.79/2.53 # Current number of unprocessed clauses: 1721
% 7.79/2.53 # ...number of literals in the above : 5564
% 7.79/2.53 # Current number of archived formulas : 0
% 7.79/2.53 # Current number of archived clauses : 1
% 7.79/2.53 # Clause-clause subsumption calls (NU) : 27413
% 7.79/2.53 # Rec. Clause-clause subsumption calls : 10142
% 7.79/2.53 # Non-unit clause-clause subsumptions : 2
% 7.79/2.53 # Unit Clause-clause subsumption calls : 2755
% 7.79/2.53 # Rewrite failures with RHS unbound : 0
% 7.79/2.53 # BW rewrite match attempts : 1
% 7.79/2.53 # BW rewrite match successes : 0
% 7.79/2.53 # Condensation attempts : 0
% 7.79/2.53 # Condensation successes : 0
% 7.79/2.53 # Termbank termtop insertions : 33657
% 7.79/2.53
% 7.79/2.53 # -------------------------------------------------
% 7.79/2.53 # User time : 0.052 s
% 7.79/2.53 # System time : 0.003 s
% 7.79/2.53 # Total time : 0.055 s
% 7.79/2.53 # ...preprocessing : 0.020 s
% 7.79/2.53 # ...main loop : 0.035 s
% 7.79/2.53 # Maximum resident set size: 9708 pages
% 7.79/2.53
%------------------------------------------------------------------------------