TSTP Solution File: LAT258+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT258+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Sun Jul 17 04:28:34 EDT 2022
% Result : Timeout 291.53s 38.04s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of clauses : 90 ( 45 unt; 0 nHn; 86 RR)
% Number of literals : 172 ( 0 equ; 85 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 143 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( less_than(X1,X2)
| ~ join(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_12) ).
cnf(i_0_2,plain,
join(x,y,t),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_2) ).
cnf(i_0_8,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_8) ).
cnf(i_0_10,plain,
( less_than(X1,X2)
| ~ meet(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_10) ).
cnf(i_0_5,plain,
meet(y,z,w),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_5) ).
cnf(i_0_1,plain,
join(x,z,u),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_1) ).
cnf(i_0_11,plain,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X1,X4)
| ~ meet(X4,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_11) ).
cnf(i_0_22,plain,
meet(X1,X2,esk1_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_22) ).
cnf(i_0_4,plain,
join(x,w,p),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_4) ).
cnf(i_0_9,plain,
( less_than(X1,X2)
| ~ meet(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_9) ).
cnf(i_0_15,plain,
( join(X1,X2,X2)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_15) ).
cnf(i_0_14,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X4,X2)
| ~ join(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_14) ).
cnf(i_0_13,plain,
( less_than(X1,X2)
| ~ join(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_13) ).
cnf(i_0_21,plain,
( less_than(X1,X2)
| ~ join(X3,X4,X2)
| ~ join(X5,X6,X7)
| ~ meet(X8,X7,X1)
| ~ meet(X8,X6,X4)
| ~ meet(X8,X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_21) ).
cnf(i_0_17,plain,
( meet(X1,X2,X3)
| ~ meet(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_17) ).
cnf(i_0_20,plain,
( join(X1,X2,X3)
| ~ join(X4,X5,X3)
| ~ join(X6,X5,X2)
| ~ join(X1,X6,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_20) ).
cnf(i_0_18,plain,
( join(X1,X2,X3)
| ~ join(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_18) ).
cnf(i_0_16,plain,
( meet(X1,X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_16) ).
cnf(i_0_3,plain,
meet(t,u,v),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_3) ).
cnf(i_0_6,plain,
( goal
| ~ less_than(v,p) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_6) ).
cnf(i_0_23,negated_conjecture,
~ goal,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_mrosw_g/input.p',i_0_23) ).
cnf(c_0_45,plain,
( less_than(X1,X2)
| ~ join(X3,X1,X2) ),
i_0_12 ).
cnf(c_0_46,plain,
join(x,y,t),
i_0_2 ).
cnf(c_0_47,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
i_0_8 ).
cnf(c_0_48,plain,
less_than(y,t),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( less_than(X1,X2)
| ~ meet(X2,X3,X1) ),
i_0_10 ).
cnf(c_0_50,plain,
meet(y,z,w),
i_0_5 ).
cnf(c_0_51,plain,
join(x,z,u),
i_0_1 ).
cnf(c_0_52,plain,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X1,X4)
| ~ meet(X4,X3,X2) ),
i_0_11 ).
cnf(c_0_53,plain,
meet(X1,X2,esk1_2(X1,X2)),
i_0_22 ).
cnf(c_0_54,plain,
join(x,w,p),
i_0_4 ).
cnf(c_0_55,plain,
( less_than(X1,t)
| ~ less_than(X1,y) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
less_than(w,y),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
less_than(z,u),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_58,plain,
( less_than(X1,X2)
| ~ meet(X3,X2,X1) ),
i_0_9 ).
cnf(c_0_59,plain,
( less_than(X1,esk1_2(X2,X3))
| ~ less_than(X1,X2)
| ~ less_than(X1,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
less_than(w,p),
inference(spm,[status(thm)],[c_0_45,c_0_54]) ).
cnf(c_0_61,plain,
( join(X1,X2,X2)
| ~ less_than(X1,X2) ),
i_0_15 ).
cnf(c_0_62,plain,
less_than(w,t),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X4,X2)
| ~ join(X4,X3,X1) ),
i_0_14 ).
cnf(c_0_64,plain,
( less_than(X1,X2)
| ~ join(X1,X3,X2) ),
i_0_13 ).
cnf(c_0_65,plain,
( less_than(X1,u)
| ~ less_than(X1,z) ),
inference(spm,[status(thm)],[c_0_47,c_0_57]) ).
cnf(c_0_66,plain,
less_than(w,z),
inference(spm,[status(thm)],[c_0_58,c_0_50]) ).
cnf(c_0_67,plain,
( less_than(X1,X2)
| ~ join(X3,X4,X2)
| ~ join(X5,X6,X7)
| ~ meet(X8,X7,X1)
| ~ meet(X8,X6,X4)
| ~ meet(X8,X5,X3) ),
i_0_21 ).
cnf(c_0_68,plain,
( meet(X1,X2,X3)
| ~ meet(X2,X1,X3) ),
i_0_17 ).
cnf(c_0_69,plain,
( less_than(w,esk1_2(p,X1))
| ~ less_than(w,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_70,plain,
( join(X1,X2,X3)
| ~ join(X4,X5,X3)
| ~ join(X6,X5,X2)
| ~ join(X1,X6,X4) ),
i_0_20 ).
cnf(c_0_71,plain,
( join(X1,X2,X3)
| ~ join(X2,X1,X3) ),
i_0_18 ).
cnf(c_0_72,plain,
join(w,t,t),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_73,plain,
( less_than(p,X1)
| ~ less_than(x,X1)
| ~ less_than(w,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_54]) ).
cnf(c_0_74,plain,
less_than(x,t),
inference(spm,[status(thm)],[c_0_64,c_0_46]) ).
cnf(c_0_75,plain,
less_than(w,u),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_76,plain,
( less_than(esk1_2(X1,X2),X3)
| ~ meet(X1,X4,X5)
| ~ meet(X1,X6,X7)
| ~ join(X6,X4,X2)
| ~ join(X7,X5,X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_53]) ).
cnf(c_0_77,plain,
meet(z,y,w),
inference(spm,[status(thm)],[c_0_68,c_0_50]) ).
cnf(c_0_78,plain,
less_than(w,esk1_2(p,z)),
inference(spm,[status(thm)],[c_0_69,c_0_66]) ).
cnf(c_0_79,plain,
( join(X1,p,X2)
| ~ join(X3,w,X2)
| ~ join(X1,x,X3) ),
inference(spm,[status(thm)],[c_0_70,c_0_54]) ).
cnf(c_0_80,plain,
join(t,w,t),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_81,plain,
( meet(X1,X2,X1)
| ~ less_than(X1,X2) ),
i_0_16 ).
cnf(c_0_82,plain,
less_than(p,t),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_62])]) ).
cnf(c_0_83,plain,
join(w,u,u),
inference(spm,[status(thm)],[c_0_61,c_0_75]) ).
cnf(c_0_84,plain,
( less_than(esk1_2(z,X1),X2)
| ~ meet(z,X3,X4)
| ~ join(X3,y,X1)
| ~ join(X4,w,X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,plain,
meet(X1,X2,esk1_2(X2,X1)),
inference(spm,[status(thm)],[c_0_68,c_0_53]) ).
cnf(c_0_86,plain,
join(w,esk1_2(p,z),esk1_2(p,z)),
inference(spm,[status(thm)],[c_0_61,c_0_78]) ).
cnf(c_0_87,plain,
( join(X1,p,t)
| ~ join(X1,x,t) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,plain,
join(y,x,t),
inference(spm,[status(thm)],[c_0_71,c_0_46]) ).
cnf(c_0_89,plain,
meet(t,u,v),
i_0_3 ).
cnf(c_0_90,plain,
meet(p,t,p),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_91,plain,
join(u,w,u),
inference(spm,[status(thm)],[c_0_71,c_0_83]) ).
cnf(c_0_92,plain,
( less_than(esk1_2(z,X1),X2)
| ~ join(esk1_2(X3,z),w,X2)
| ~ join(X3,y,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_93,plain,
join(esk1_2(p,z),w,esk1_2(p,z)),
inference(spm,[status(thm)],[c_0_71,c_0_86]) ).
cnf(c_0_94,plain,
join(y,p,t),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_95,plain,
( less_than(v,X1)
| ~ meet(t,X2,X3)
| ~ meet(t,X4,X5)
| ~ join(X4,X2,u)
| ~ join(X5,X3,X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_89]) ).
cnf(c_0_96,plain,
meet(t,p,p),
inference(spm,[status(thm)],[c_0_68,c_0_90]) ).
cnf(c_0_97,plain,
( join(X1,p,u)
| ~ join(X1,x,u) ),
inference(spm,[status(thm)],[c_0_79,c_0_91]) ).
cnf(c_0_98,plain,
join(z,x,u),
inference(spm,[status(thm)],[c_0_71,c_0_51]) ).
cnf(c_0_99,plain,
less_than(esk1_2(X1,X2),X1),
inference(spm,[status(thm)],[c_0_49,c_0_53]) ).
cnf(c_0_100,plain,
( less_than(esk1_2(z,X1),esk1_2(p,z))
| ~ join(p,y,X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_101,plain,
join(p,y,t),
inference(spm,[status(thm)],[c_0_71,c_0_94]) ).
cnf(c_0_102,plain,
( less_than(v,X1)
| ~ meet(t,X2,X3)
| ~ join(X2,p,u)
| ~ join(X3,p,X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_103,plain,
join(z,p,u),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_104,plain,
( less_than(X1,X2)
| ~ less_than(X1,esk1_2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_47,c_0_99]) ).
cnf(c_0_105,plain,
less_than(esk1_2(z,t),esk1_2(p,z)),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_106,plain,
( less_than(v,X1)
| ~ meet(t,z,X2)
| ~ join(X2,p,X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
less_than(esk1_2(z,t),p),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_108,plain,
( goal
| ~ less_than(v,p) ),
i_0_6 ).
cnf(c_0_109,negated_conjecture,
~ goal,
i_0_23 ).
cnf(c_0_110,plain,
( less_than(v,X1)
| ~ join(esk1_2(z,t),p,X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_85]) ).
cnf(c_0_111,plain,
join(esk1_2(z,t),p,p),
inference(spm,[status(thm)],[c_0_61,c_0_107]) ).
cnf(c_0_112,plain,
~ less_than(v,p),
inference(sr,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT258+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 28 19:08:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 291.53/38.04 # ENIGMATIC: Solved by autoschedule:
% 291.53/38.04 # No SInE strategy applied
% 291.53/38.04 # Trying AutoSched0 for 150 seconds
% 291.53/38.04 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 291.53/38.04 # and selection function SelectComplexG.
% 291.53/38.04 #
% 291.53/38.04 # Preprocessing time : 0.021 s
% 291.53/38.04
% 291.53/38.04 # Proof found!
% 291.53/38.04 # SZS status Theorem
% 291.53/38.04 # SZS output start CNFRefutation
% See solution above
% 291.53/38.04 # Training examples: 0 positive, 0 negative
% 291.53/38.04
% 291.53/38.04 # -------------------------------------------------
% 291.53/38.04 # User time : 34.623 s
% 291.53/38.04 # System time : 0.958 s
% 291.53/38.04 # Total time : 35.581 s
% 291.53/38.04 # Maximum resident set size: 7124 pages
% 291.53/38.04
%------------------------------------------------------------------------------