TSTP Solution File: NUM441+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM441+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:36:02 EDT 2022
% Result : Theorem 7.89s 2.34s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 26 ( 2 equ; 12 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_107,plain,
( isOpen0(sdtslmnbsdt0(X1,X2))
| ~ isOpen0(X2)
| ~ isOpen0(X1)
| ~ aSubsetOf0(X2,cS1395)
| ~ aSubsetOf0(X1,cS1395) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_107) ).
cnf(i_0_178,hypothesis,
aSubsetOf0(stldt0(xB),cS1395),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_178) ).
cnf(i_0_109,hypothesis,
isOpen0(stldt0(xB)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_109) ).
cnf(i_0_187,hypothesis,
aSubsetOf0(stldt0(xA),cS1395),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_187) ).
cnf(i_0_158,hypothesis,
sdtslmnbsdt0(stldt0(xA),stldt0(xB)) = stldt0(sdtbsmnsldt0(xA,xB)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_158) ).
cnf(i_0_128,hypothesis,
isOpen0(stldt0(xA)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_128) ).
cnf(i_0_197,negated_conjecture,
~ isOpen0(stldt0(sdtbsmnsldt0(xA,xB))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-od6u2eeg/lgb.p',i_0_197) ).
cnf(c_0_205,plain,
( isOpen0(sdtslmnbsdt0(X1,X2))
| ~ isOpen0(X2)
| ~ isOpen0(X1)
| ~ aSubsetOf0(X2,cS1395)
| ~ aSubsetOf0(X1,cS1395) ),
i_0_107 ).
cnf(c_0_206,hypothesis,
aSubsetOf0(stldt0(xB),cS1395),
i_0_178 ).
cnf(c_0_207,hypothesis,
isOpen0(stldt0(xB)),
i_0_109 ).
cnf(c_0_208,hypothesis,
( isOpen0(sdtslmnbsdt0(X1,stldt0(xB)))
| ~ aSubsetOf0(X1,cS1395)
| ~ isOpen0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_206]),c_0_207])]) ).
cnf(c_0_209,hypothesis,
aSubsetOf0(stldt0(xA),cS1395),
i_0_187 ).
cnf(c_0_210,hypothesis,
sdtslmnbsdt0(stldt0(xA),stldt0(xB)) = stldt0(sdtbsmnsldt0(xA,xB)),
i_0_158 ).
cnf(c_0_211,hypothesis,
isOpen0(stldt0(xA)),
i_0_128 ).
cnf(c_0_212,negated_conjecture,
~ isOpen0(stldt0(sdtbsmnsldt0(xA,xB))),
i_0_197 ).
cnf(c_0_213,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_208,c_0_209]),c_0_210]),c_0_211])]),c_0_212]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM441+6 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 : Thu Jul 7 07:51:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.89/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.89/2.34 # No SInE strategy applied
% 7.89/2.34 # Trying AutoSched0 for 150 seconds
% 7.89/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.89/2.34 # and selection function SelectNewComplexAHP.
% 7.89/2.34 #
% 7.89/2.34 # Preprocessing time : 0.014 s
% 7.89/2.34 # Presaturation interreduction done
% 7.89/2.34
% 7.89/2.34 # Proof found!
% 7.89/2.34 # SZS status Theorem
% 7.89/2.34 # SZS output start CNFRefutation
% See solution above
% 7.89/2.34 # Training examples: 0 positive, 0 negative
% 7.89/2.34
% 7.89/2.34 # -------------------------------------------------
% 7.89/2.34 # User time : 0.015 s
% 7.89/2.34 # System time : 0.006 s
% 7.89/2.34 # Total time : 0.021 s
% 7.89/2.34 # Maximum resident set size: 7128 pages
% 7.89/2.34
%------------------------------------------------------------------------------