TSTP Solution File: CSR114+8 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR114+8 : 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:11 EDT 2022
% Result : Theorem 8.62s 2.87s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 48 ( 0 equ; 33 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 40 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_640,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ sub(X3,stadt__1_1)
| ~ val(X4,rom_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_640) ).
cnf(i_0_156,hypothesis,
val(c12,rom_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_156) ).
cnf(i_0_157,hypothesis,
sub(c12,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_157) ).
cnf(i_0_158,hypothesis,
sub(c11,stadt__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_158) ).
cnf(i_0_159,hypothesis,
attr(c11,c12),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_159) ).
cnf(i_0_33,plain,
( scar(esk6_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/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_33) ).
cnf(i_0_511,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_511) ).
cnf(i_0_510,plain,
member(X1,cons(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k4ghqgb0/lgb.p',i_0_510) ).
cnf(c_0_649,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ sub(X3,stadt__1_1)
| ~ val(X4,rom_0) ),
i_0_640 ).
cnf(c_0_650,hypothesis,
val(c12,rom_0),
i_0_156 ).
cnf(c_0_651,hypothesis,
sub(c12,name_1_1),
i_0_157 ).
cnf(c_0_652,hypothesis,
( ~ sub(X1,stadt__1_1)
| ~ attr(X1,c12)
| ~ scar(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_649,c_0_650]),c_0_651])]) ).
cnf(c_0_653,hypothesis,
sub(c11,stadt__1_1),
i_0_158 ).
cnf(c_0_654,hypothesis,
attr(c11,c12),
i_0_159 ).
cnf(c_0_655,plain,
( scar(esk6_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_33 ).
cnf(c_0_656,hypothesis,
~ scar(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_652,c_0_653]),c_0_654])]) ).
cnf(c_0_657,plain,
( ~ member(X1,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X2,X1)
| ~ attr(X3,X2) ),
inference(sr,[status(thm)],[c_0_655,c_0_656]) ).
cnf(c_0_658,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
i_0_511 ).
cnf(c_0_659,plain,
( ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil)))
| ~ sub(X2,X1)
| ~ attr(X3,X2) ),
inference(spm,[status(thm)],[c_0_657,c_0_658]) ).
cnf(c_0_660,plain,
( ~ member(X1,cons(name_1_1,nil))
| ~ sub(X2,X1)
| ~ attr(X3,X2) ),
inference(spm,[status(thm)],[c_0_659,c_0_658]) ).
cnf(c_0_661,plain,
member(X1,cons(X1,X2)),
i_0_510 ).
cnf(c_0_662,plain,
( ~ sub(X1,name_1_1)
| ~ attr(X2,X1) ),
inference(spm,[status(thm)],[c_0_660,c_0_661]) ).
cnf(c_0_663,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_662,c_0_654]),c_0_651])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR114+8 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 17:49:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.43/0.62 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.62/2.87 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.62/2.87 # No SInE strategy applied
% 8.62/2.87 # Trying AutoSched0 for 150 seconds
% 8.62/2.87 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.62/2.87 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.62/2.87 #
% 8.62/2.87 # Preprocessing time : 0.028 s
% 8.62/2.87 # Presaturation interreduction done
% 8.62/2.87
% 8.62/2.87 # Proof found!
% 8.62/2.87 # SZS status Theorem
% 8.62/2.87 # SZS output start CNFRefutation
% See solution above
% 8.62/2.87 # Training examples: 0 positive, 0 negative
% 8.62/2.87
% 8.62/2.87 # -------------------------------------------------
% 8.62/2.87 # User time : 0.047 s
% 8.62/2.87 # System time : 0.006 s
% 8.62/2.87 # Total time : 0.053 s
% 8.62/2.87 # Maximum resident set size: 7124 pages
% 8.62/2.87
%------------------------------------------------------------------------------