TSTP Solution File: SEU344+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU344+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Tue Jul 19 08:41:00 EDT 2022
% Result : Theorem 8.20s 3.18s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 14 unt; 6 nHn; 28 RR)
% Number of literals : 76 ( 13 equ; 43 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_299,plain,
( join(X1,X2,X3) = X3
| empty_carrier(X1)
| ~ join_semilatt_str(X1)
| ~ below(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_299) ).
cnf(i_0_2248,lemma,
( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2248) ).
cnf(i_0_547,plain,
~ empty_carrier(boole_lattice(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_547) ).
cnf(i_0_2302,negated_conjecture,
( subset(esk401_0,esk402_0)
| below(boole_lattice(esk400_0),esk401_0,esk402_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2302) ).
cnf(i_0_2304,negated_conjecture,
element(esk402_0,the_carrier(boole_lattice(esk400_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2304) ).
cnf(i_0_2305,negated_conjecture,
element(esk401_0,the_carrier(boole_lattice(esk400_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2305) ).
cnf(i_0_2193,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2193) ).
cnf(i_0_503,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_503) ).
cnf(i_0_468,plain,
latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_468) ).
cnf(i_0_2467,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2467) ).
cnf(i_0_298,plain,
( empty_carrier(X1)
| below(X1,X2,X3)
| join(X1,X2,X3) != X3
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_298) ).
cnf(i_0_2303,negated_conjecture,
( ~ subset(esk401_0,esk402_0)
| ~ below(boole_lattice(esk400_0),esk401_0,esk402_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9j1y_ar/lgb.p',i_0_2303) ).
cnf(c_0_2480,plain,
( join(X1,X2,X3) = X3
| empty_carrier(X1)
| ~ join_semilatt_str(X1)
| ~ below(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_299 ).
cnf(c_0_2481,lemma,
( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
i_0_2248 ).
cnf(c_0_2482,plain,
~ empty_carrier(boole_lattice(X1)),
i_0_547 ).
cnf(c_0_2483,plain,
( set_union2(X1,X2) = X2
| ~ join_semilatt_str(boole_lattice(X3))
| ~ element(X2,the_carrier(boole_lattice(X3)))
| ~ element(X1,the_carrier(boole_lattice(X3)))
| ~ below(boole_lattice(X3),X1,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2480,c_0_2481]),c_0_2482]) ).
cnf(c_0_2484,negated_conjecture,
( subset(esk401_0,esk402_0)
| below(boole_lattice(esk400_0),esk401_0,esk402_0) ),
i_0_2302 ).
cnf(c_0_2485,negated_conjecture,
element(esk402_0,the_carrier(boole_lattice(esk400_0))),
i_0_2304 ).
cnf(c_0_2486,negated_conjecture,
element(esk401_0,the_carrier(boole_lattice(esk400_0))),
i_0_2305 ).
cnf(c_0_2487,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
i_0_2193 ).
cnf(c_0_2488,negated_conjecture,
( set_union2(esk401_0,esk402_0) = esk402_0
| ~ join_semilatt_str(boole_lattice(esk400_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2483,c_0_2484]),c_0_2485]),c_0_2486])]),c_0_2487]) ).
cnf(c_0_2489,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_503 ).
cnf(c_0_2490,plain,
latt_str(boole_lattice(X1)),
i_0_468 ).
cnf(c_0_2491,lemma,
subset(X1,set_union2(X1,X2)),
i_0_2467 ).
cnf(c_0_2492,plain,
set_union2(esk401_0,esk402_0) = esk402_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2488,c_0_2489]),c_0_2490])]) ).
cnf(c_0_2493,plain,
( empty_carrier(X1)
| below(X1,X2,X3)
| join(X1,X2,X3) != X3
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_298 ).
cnf(c_0_2494,negated_conjecture,
( ~ subset(esk401_0,esk402_0)
| ~ below(boole_lattice(esk400_0),esk401_0,esk402_0) ),
i_0_2303 ).
cnf(c_0_2495,lemma,
subset(esk401_0,esk402_0),
inference(spm,[status(thm)],[c_0_2491,c_0_2492]) ).
cnf(c_0_2496,plain,
( below(boole_lattice(X1),X2,X3)
| set_union2(X2,X3) != X3
| ~ join_semilatt_str(boole_lattice(X1))
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2493,c_0_2481]),c_0_2482]) ).
cnf(c_0_2497,negated_conjecture,
~ below(boole_lattice(esk400_0),esk401_0,esk402_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2494,c_0_2495])]) ).
cnf(c_0_2498,plain,
( below(boole_lattice(X1),X2,X3)
| set_union2(X2,X3) != X3
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2496,c_0_2489]),c_0_2490])]) ).
cnf(c_0_2499,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2497,c_0_2498]),c_0_2492]),c_0_2485]),c_0_2486])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU344+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 03:59:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.19/0.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.20/3.18 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.20/3.18 # No SInE strategy applied
% 8.20/3.18 # Trying AutoSched0 for 150 seconds
% 8.20/3.18 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.20/3.18 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.20/3.18 #
% 8.20/3.18 # Preprocessing time : 0.026 s
% 8.20/3.18
% 8.20/3.18 # Proof found!
% 8.20/3.18 # SZS status Theorem
% 8.20/3.18 # SZS output start CNFRefutation
% See solution above
% 8.20/3.18 # Training examples: 0 positive, 0 negative
% 8.20/3.18
% 8.20/3.18 # -------------------------------------------------
% 8.20/3.18 # User time : 0.037 s
% 8.20/3.18 # System time : 0.007 s
% 8.20/3.18 # Total time : 0.044 s
% 8.20/3.18 # Maximum resident set size: 7248 pages
% 8.20/3.18
%------------------------------------------------------------------------------