TSTP Solution File: SEU304+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU304+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:40:36 EDT 2022
% Result : Theorem 6.99s 2.28s
% Output : CNFRefutation 6.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 18 unt; 11 nHn; 35 RR)
% Number of literals : 94 ( 11 equ; 55 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_25) ).
cnf(i_0_62,negated_conjecture,
latt_str(esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_62) ).
cnf(i_0_59,negated_conjecture,
~ below(esk12_0,meet_commut(esk12_0,esk13_0,esk14_0),esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_59) ).
cnf(i_0_8,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-h3frhrg2/input.p',i_0_8) ).
cnf(i_0_61,negated_conjecture,
element(esk13_0,the_carrier(esk12_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_61) ).
cnf(i_0_65,negated_conjecture,
~ empty_carrier(esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_65) ).
cnf(i_0_5,plain,
( meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2)
| empty_carrier(X1)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_5) ).
cnf(i_0_54,plain,
( meet_commut(X1,X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_54) ).
cnf(i_0_26,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_26) ).
cnf(i_0_60,negated_conjecture,
element(esk14_0,the_carrier(esk12_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_60) ).
cnf(i_0_64,negated_conjecture,
meet_commutative(esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_64) ).
cnf(i_0_13,plain,
( join(X1,meet(X1,X2,X3),X3) = X3
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ meet_absorbing(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_13) ).
cnf(i_0_63,negated_conjecture,
meet_absorbing(esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_63) ).
cnf(i_0_19,plain,
( empty_carrier(X1)
| element(meet(X1,X2,X3),the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h3frhrg2/input.p',i_0_19) ).
cnf(c_0_80,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_25 ).
cnf(c_0_81,negated_conjecture,
latt_str(esk12_0),
i_0_62 ).
cnf(c_0_82,negated_conjecture,
~ below(esk12_0,meet_commut(esk12_0,esk13_0,esk14_0),esk13_0),
i_0_59 ).
cnf(c_0_83,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_8 ).
cnf(c_0_84,negated_conjecture,
element(esk13_0,the_carrier(esk12_0)),
i_0_61 ).
cnf(c_0_85,negated_conjecture,
~ empty_carrier(esk12_0),
i_0_65 ).
cnf(c_0_86,negated_conjecture,
join_semilatt_str(esk12_0),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
( meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2)
| empty_carrier(X1)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_5 ).
cnf(c_0_88,plain,
( meet_commut(X1,X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_54 ).
cnf(c_0_89,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_26 ).
cnf(c_0_90,negated_conjecture,
( join(esk12_0,meet_commut(esk12_0,esk13_0,esk14_0),esk13_0) != esk13_0
| ~ element(meet_commut(esk12_0,esk13_0,esk14_0),the_carrier(esk12_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]),c_0_85]),c_0_86])]) ).
cnf(c_0_91,plain,
( meet_commut(X1,X2,X3) = meet(X1,X3,X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
element(esk14_0,the_carrier(esk12_0)),
i_0_60 ).
cnf(c_0_93,negated_conjecture,
meet_semilatt_str(esk12_0),
inference(spm,[status(thm)],[c_0_89,c_0_81]) ).
cnf(c_0_94,negated_conjecture,
meet_commutative(esk12_0),
i_0_64 ).
cnf(c_0_95,negated_conjecture,
( join(esk12_0,meet(esk12_0,esk14_0,esk13_0),esk13_0) != esk13_0
| ~ element(meet(esk12_0,esk14_0,esk13_0),the_carrier(esk12_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_84]),c_0_92]),c_0_93]),c_0_94])]),c_0_85]) ).
cnf(c_0_96,plain,
( join(X1,meet(X1,X2,X3),X3) = X3
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ meet_absorbing(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_13 ).
cnf(c_0_97,negated_conjecture,
meet_absorbing(esk12_0),
i_0_63 ).
cnf(c_0_98,plain,
~ element(meet(esk12_0,esk14_0,esk13_0),the_carrier(esk12_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_84]),c_0_92]),c_0_97]),c_0_81])]),c_0_85]) ).
cnf(c_0_99,plain,
( empty_carrier(X1)
| element(meet(X1,X2,X3),the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_19 ).
cnf(c_0_100,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_84]),c_0_92]),c_0_93])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU304+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.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 18:30:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 6.99/2.28 # ENIGMATIC: Solved by autoschedule:
% 6.99/2.28 # No SInE strategy applied
% 6.99/2.28 # Trying AutoSched0 for 150 seconds
% 6.99/2.28 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 6.99/2.28 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.99/2.28 #
% 6.99/2.28 # Preprocessing time : 0.025 s
% 6.99/2.28
% 6.99/2.28 # Proof found!
% 6.99/2.28 # SZS status Theorem
% 6.99/2.28 # SZS output start CNFRefutation
% See solution above
% 6.99/2.28 # Training examples: 0 positive, 0 negative
% 6.99/2.28
% 6.99/2.28 # -------------------------------------------------
% 6.99/2.28 # User time : 0.026 s
% 6.99/2.28 # System time : 0.011 s
% 6.99/2.28 # Total time : 0.038 s
% 6.99/2.28 # Maximum resident set size: 7116 pages
% 6.99/2.28
%------------------------------------------------------------------------------