TSTP Solution File: SEU344+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU344+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 4.49s 2.28s
% Output : CNFRefutation 4.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 15 unt; 7 nHn; 27 RR)
% Number of literals : 68 ( 13 equ; 36 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 : 33 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_95,negated_conjecture,
( ~ subset(esk17_0,esk18_0)
| ~ below(boole_lattice(esk16_0),esk17_0,esk18_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_95) ).
cnf(i_0_10,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/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_10) ).
cnf(i_0_96,negated_conjecture,
element(esk18_0,the_carrier(boole_lattice(esk16_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_96) ).
cnf(i_0_97,negated_conjecture,
element(esk17_0,the_carrier(boole_lattice(esk16_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_97) ).
cnf(i_0_53,plain,
~ empty_carrier(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_53) ).
cnf(i_0_33,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_33) ).
cnf(i_0_17,plain,
latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_17) ).
cnf(i_0_11,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/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_11) ).
cnf(i_0_94,negated_conjecture,
( subset(esk17_0,esk18_0)
| below(boole_lattice(esk16_0),esk17_0,esk18_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_94) ).
cnf(i_0_91,plain,
( 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/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_91) ).
cnf(i_0_88,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_88) ).
cnf(i_0_105,plain,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-afxe8ii3/input.p',i_0_105) ).
cnf(c_0_118,negated_conjecture,
( ~ subset(esk17_0,esk18_0)
| ~ below(boole_lattice(esk16_0),esk17_0,esk18_0) ),
i_0_95 ).
cnf(c_0_119,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_10 ).
cnf(c_0_120,negated_conjecture,
element(esk18_0,the_carrier(boole_lattice(esk16_0))),
i_0_96 ).
cnf(c_0_121,negated_conjecture,
element(esk17_0,the_carrier(boole_lattice(esk16_0))),
i_0_97 ).
cnf(c_0_122,plain,
~ empty_carrier(boole_lattice(X1)),
i_0_53 ).
cnf(c_0_123,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_33 ).
cnf(c_0_124,plain,
latt_str(boole_lattice(X1)),
i_0_17 ).
cnf(c_0_125,negated_conjecture,
( join(boole_lattice(esk16_0),esk17_0,esk18_0) != esk18_0
| ~ subset(esk17_0,esk18_0)
| ~ join_semilatt_str(boole_lattice(esk16_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_126,plain,
join_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_127,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_11 ).
cnf(c_0_128,negated_conjecture,
( subset(esk17_0,esk18_0)
| below(boole_lattice(esk16_0),esk17_0,esk18_0) ),
i_0_94 ).
cnf(c_0_129,negated_conjecture,
( join(boole_lattice(esk16_0),esk17_0,esk18_0) != esk18_0
| ~ subset(esk17_0,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_126])]) ).
cnf(c_0_130,plain,
( 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_91 ).
cnf(c_0_131,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
i_0_88 ).
cnf(c_0_132,negated_conjecture,
( join(boole_lattice(esk16_0),esk17_0,esk18_0) = esk18_0
| subset(esk17_0,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_120]),c_0_121])]),c_0_122]),c_0_126])]) ).
cnf(c_0_133,plain,
~ subset(esk17_0,esk18_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_120]),c_0_121])]),c_0_131]) ).
cnf(c_0_134,negated_conjecture,
join(boole_lattice(esk16_0),esk17_0,esk18_0) = esk18_0,
inference(sr,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_135,plain,
subset(X1,set_union2(X1,X2)),
i_0_105 ).
cnf(c_0_136,plain,
set_union2(esk17_0,esk18_0) = esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_134]),c_0_120]),c_0_121])]) ).
cnf(c_0_137,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_133]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU344+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 20 11:21:20 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.38 # ENIGMATIC: Selected complete mode:
% 4.49/2.28 # ENIGMATIC: Solved by autoschedule:
% 4.49/2.28 # No SInE strategy applied
% 4.49/2.28 # Trying AutoSched0 for 150 seconds
% 4.49/2.28 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 4.49/2.28 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.49/2.28 #
% 4.49/2.28 # Preprocessing time : 0.016 s
% 4.49/2.28
% 4.49/2.28 # Proof found!
% 4.49/2.28 # SZS status Theorem
% 4.49/2.28 # SZS output start CNFRefutation
% See solution above
% 4.49/2.28 # Training examples: 0 positive, 0 negative
% 4.49/2.28
% 4.49/2.28 # -------------------------------------------------
% 4.49/2.28 # User time : 0.021 s
% 4.49/2.28 # System time : 0.006 s
% 4.49/2.28 # Total time : 0.026 s
% 4.49/2.28 # Maximum resident set size: 7120 pages
% 4.49/2.28
%------------------------------------------------------------------------------