TSTP Solution File: NUM393+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Mon Jul 18 08:35:39 EDT 2022
% Result : Theorem 7.58s 2.33s
% Output : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 10 unt; 4 nHn; 20 RR)
% Number of literals : 39 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_10) ).
cnf(i_0_54,negated_conjecture,
ordinal(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_54) ).
cnf(i_0_55,negated_conjecture,
ordinal(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_55) ).
cnf(i_0_53,negated_conjecture,
~ inclusion_comparable(esk13_0,esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_53) ).
cnf(i_0_11,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_11) ).
cnf(i_0_47,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_47) ).
cnf(i_0_12,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-goelifim/lgb.p',i_0_12) ).
cnf(c_0_63,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
i_0_10 ).
cnf(c_0_64,negated_conjecture,
ordinal(esk14_0),
i_0_54 ).
cnf(c_0_65,negated_conjecture,
( ordinal_subset(X1,esk14_0)
| ordinal_subset(esk14_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
ordinal(esk13_0),
i_0_55 ).
cnf(c_0_67,negated_conjecture,
~ inclusion_comparable(esk13_0,esk14_0),
i_0_53 ).
cnf(c_0_68,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
i_0_11 ).
cnf(c_0_69,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_47 ).
cnf(c_0_70,negated_conjecture,
( ordinal_subset(esk14_0,esk13_0)
| ordinal_subset(esk13_0,esk14_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
~ subset(esk14_0,esk13_0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
i_0_12 ).
cnf(c_0_73,plain,
ordinal_subset(esk13_0,esk14_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_66]),c_0_64])]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
~ subset(esk13_0,esk14_0),
inference(spm,[status(thm)],[c_0_67,c_0_72]) ).
cnf(c_0_75,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_73]),c_0_64]),c_0_66])]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 00:19:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.58/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.33 # No SInE strategy applied
% 7.58/2.33 # Trying AutoSched0 for 150 seconds
% 7.58/2.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.58/2.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.58/2.33 #
% 7.58/2.33 # Preprocessing time : 0.017 s
% 7.58/2.33 # Presaturation interreduction done
% 7.58/2.33
% 7.58/2.33 # Proof found!
% 7.58/2.33 # SZS status Theorem
% 7.58/2.33 # SZS output start CNFRefutation
% See solution above
% 7.58/2.33 # Training examples: 0 positive, 0 negative
% 7.58/2.33
% 7.58/2.33 # -------------------------------------------------
% 7.58/2.33 # User time : 0.022 s
% 7.58/2.33 # System time : 0.005 s
% 7.58/2.33 # Total time : 0.027 s
% 7.58/2.33 # Maximum resident set size: 7128 pages
% 7.58/2.33
%------------------------------------------------------------------------------