TSTP Solution File: SEU305+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU305+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:37 EDT 2022
% Result : Theorem 7.41s 2.38s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 20 unt; 6 nHn; 30 RR)
% Number of literals : 66 ( 15 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,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-qpnyzd7s/input.p',i_0_8) ).
cnf(i_0_49,negated_conjecture,
element(esk9_0,the_carrier(esk8_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_49) ).
cnf(i_0_50,negated_conjecture,
join_semilatt_str(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_50) ).
cnf(i_0_52,negated_conjecture,
~ empty_carrier(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_52) ).
cnf(i_0_40,plain,
( join_commut(X1,X2,X3) = join(X1,X2,X3)
| empty_carrier(X1)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_40) ).
cnf(i_0_51,negated_conjecture,
join_commutative(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_51) ).
cnf(i_0_5,plain,
( join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
| empty_carrier(X1)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_5) ).
cnf(i_0_48,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_48) ).
cnf(i_0_46,negated_conjecture,
below(esk8_0,esk10_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_46) ).
cnf(i_0_47,negated_conjecture,
below(esk8_0,esk9_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_47) ).
cnf(i_0_45,negated_conjecture,
esk10_0 != esk9_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qpnyzd7s/input.p',i_0_45) ).
cnf(c_0_64,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_8 ).
cnf(c_0_65,negated_conjecture,
element(esk9_0,the_carrier(esk8_0)),
i_0_49 ).
cnf(c_0_66,negated_conjecture,
join_semilatt_str(esk8_0),
i_0_50 ).
cnf(c_0_67,negated_conjecture,
~ empty_carrier(esk8_0),
i_0_52 ).
cnf(c_0_68,plain,
( join_commut(X1,X2,X3) = join(X1,X2,X3)
| empty_carrier(X1)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_40 ).
cnf(c_0_69,negated_conjecture,
join_commutative(esk8_0),
i_0_51 ).
cnf(c_0_70,plain,
( join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
| empty_carrier(X1)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_5 ).
cnf(c_0_71,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
i_0_48 ).
cnf(c_0_72,negated_conjecture,
( join(esk8_0,X1,esk9_0) = esk9_0
| ~ below(esk8_0,X1,esk9_0)
| ~ element(X1,the_carrier(esk8_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]) ).
cnf(c_0_73,negated_conjecture,
below(esk8_0,esk10_0,esk9_0),
i_0_46 ).
cnf(c_0_74,negated_conjecture,
( join_commut(esk8_0,X1,esk9_0) = join(esk8_0,X1,esk9_0)
| ~ element(X1,the_carrier(esk8_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_65]),c_0_66]),c_0_69])]),c_0_67]) ).
cnf(c_0_75,negated_conjecture,
( join_commut(esk8_0,X1,esk10_0) = join_commut(esk8_0,esk10_0,X1)
| ~ element(X1,the_carrier(esk8_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_66]),c_0_69])]),c_0_67]) ).
cnf(c_0_76,negated_conjecture,
join(esk8_0,esk10_0,esk9_0) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_71])]) ).
cnf(c_0_77,negated_conjecture,
( join(esk8_0,X1,esk10_0) = esk10_0
| ~ below(esk8_0,X1,esk10_0)
| ~ element(X1,the_carrier(esk8_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_71]),c_0_66])]),c_0_67]) ).
cnf(c_0_78,negated_conjecture,
below(esk8_0,esk9_0,esk10_0),
i_0_47 ).
cnf(c_0_79,negated_conjecture,
join_commut(esk8_0,esk9_0,esk10_0) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_71]),c_0_65])]) ).
cnf(c_0_80,negated_conjecture,
join(esk8_0,esk9_0,esk10_0) = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_65])]) ).
cnf(c_0_81,negated_conjecture,
esk10_0 != esk9_0,
i_0_45 ).
cnf(c_0_82,plain,
$false,
inference(sr,[status(thm)],[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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_79]),c_0_80]),c_0_71]),c_0_65]),c_0_66]),c_0_69])]),c_0_81]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU305+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jun 18 19:17:01 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.41/2.38 # ENIGMATIC: Solved by autoschedule:
% 7.41/2.38 # No SInE strategy applied
% 7.41/2.38 # Trying AutoSched0 for 150 seconds
% 7.41/2.38 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 7.41/2.38 # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.41/2.38 #
% 7.41/2.38 # Preprocessing time : 0.023 s
% 7.41/2.38
% 7.41/2.38 # Proof found!
% 7.41/2.38 # SZS status Theorem
% 7.41/2.38 # SZS output start CNFRefutation
% See solution above
% 7.41/2.39 # Training examples: 0 positive, 0 negative
% 7.41/2.39
% 7.41/2.39 # -------------------------------------------------
% 7.41/2.39 # User time : 0.033 s
% 7.41/2.39 # System time : 0.002 s
% 7.41/2.39 # Total time : 0.035 s
% 7.41/2.39 # Maximum resident set size: 7116 pages
% 7.41/2.39
%------------------------------------------------------------------------------