TSTP Solution File: LCL894+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 09:33:29 EDT 2022
% Result : Theorem 8.54s 2.34s
% Output : CNFRefutation 8.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 25 unt; 4 nHn; 32 RR)
% Number of literals : 90 ( 12 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_3) ).
cnf(i_0_2,plain,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_2) ).
cnf(i_0_10,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_10) ).
cnf(i_0_9,plain,
'>='(X1,'0'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_9) ).
cnf(i_0_5,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_5) ).
cnf(i_0_15,negated_conjecture,
( '>='(c,a)
| '>='(c,'+'(a,'==>'(a,b))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_15) ).
cnf(i_0_13,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
( '>='(c,b)
| '>='(c,'+'(a,'==>'(a,b))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_14) ).
cnf(i_0_6,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_6) ).
cnf(i_0_8,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_8) ).
cnf(i_0_4,plain,
'>='(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_4) ).
cnf(i_0_7,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_7) ).
cnf(i_0_16,negated_conjecture,
( ~ '>='(c,a)
| ~ '>='(c,b)
| ~ '>='(c,'+'(a,'==>'(a,b))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-56d_v1je/input.p',i_0_16) ).
cnf(c_0_30,plain,
'+'(X1,'0') = X1,
i_0_3 ).
cnf(c_0_31,plain,
'+'(X1,X2) = '+'(X2,X1),
i_0_2 ).
cnf(c_0_32,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
i_0_10 ).
cnf(c_0_33,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
'>='(X1,'0'),
i_0_9 ).
cnf(c_0_35,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
i_0_5 ).
cnf(c_0_36,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X3,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X2,X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( '>='(c,a)
| '>='(c,'+'(a,'==>'(a,b))) ),
i_0_15 ).
cnf(c_0_40,negated_conjecture,
'>='(c,a),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( '>='(X1,a)
| ~ '>='(X1,c) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_42,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
i_0_13 ).
cnf(c_0_43,plain,
'>='('+'(X1,c),a),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_44,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X3,'==>'(X3,X2))) ),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( '>='(c,b)
| '>='(c,'+'(a,'==>'(a,b))) ),
i_0_14 ).
cnf(c_0_46,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
i_0_6 ).
cnf(c_0_47,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
i_0_8 ).
cnf(c_0_48,plain,
'>='('+'(c,X1),a),
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
cnf(c_0_49,negated_conjecture,
'>='(c,b),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_51,plain,
'>='(X1,'==>'(c,a)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( '>='(X1,b)
| ~ '>='(X1,c) ),
inference(spm,[status(thm)],[c_0_35,c_0_49]) ).
cnf(c_0_53,plain,
'==>'(c,a) = '0',
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
'>='(X1,X1),
i_0_4 ).
cnf(c_0_55,plain,
( '>='(X1,b)
| ~ '>='(X2,c)
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_52]) ).
cnf(c_0_56,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_57,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
i_0_7 ).
cnf(c_0_58,plain,
'+'(a,'==>'(a,c)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_53]),c_0_30]) ).
cnf(c_0_59,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_47,c_0_54]) ).
cnf(c_0_60,plain,
( '>='(X1,b)
| ~ '>='(X1,'+'(c,X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ '>='(c,a)
| ~ '>='(c,b)
| ~ '>='(c,'+'(a,'==>'(a,b))) ),
i_0_16 ).
cnf(c_0_62,plain,
( '>='(c,X1)
| ~ '>='('==>'(a,c),'==>'(a,X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( '>='(X1,'==>'(X2,'+'(X2,X3)))
| ~ '>='(X1,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_59]) ).
cnf(c_0_64,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='('+'(X2,'==>'(X2,X1)),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_42]) ).
cnf(c_0_65,plain,
'>='('+'(c,X1),b),
inference(spm,[status(thm)],[c_0_60,c_0_54]) ).
cnf(c_0_66,negated_conjecture,
( ~ '>='(c,'+'(a,'==>'(a,b)))
| ~ '>='(c,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_40])]) ).
cnf(c_0_67,plain,
( '>='(c,'+'(a,X1))
| ~ '>='('==>'(a,c),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
'>='('==>'(X1,c),'==>'(X1,b)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ '>='(c,'+'(a,'==>'(a,b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_49])]) ).
cnf(c_0_70,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 4 08:45:34 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.54/2.34 # ENIGMATIC: Solved by autoschedule:
% 8.54/2.34 # No SInE strategy applied
% 8.54/2.34 # Trying AutoSched0 for 150 seconds
% 8.54/2.34 # AutoSched0-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr
% 8.54/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.54/2.34 #
% 8.54/2.34 # Preprocessing time : 0.022 s
% 8.54/2.34 # Presaturation interreduction done
% 8.54/2.34
% 8.54/2.34 # Proof found!
% 8.54/2.34 # SZS status Theorem
% 8.54/2.34 # SZS output start CNFRefutation
% See solution above
% 8.54/2.34 # Training examples: 0 positive, 0 negative
% 8.54/2.34
% 8.54/2.34 # -------------------------------------------------
% 8.54/2.34 # User time : 0.079 s
% 8.54/2.34 # System time : 0.003 s
% 8.54/2.34 # Total time : 0.082 s
% 8.54/2.34 # Maximum resident set size: 7124 pages
% 8.54/2.34
%------------------------------------------------------------------------------