TSTP Solution File: NLP143+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NLP143+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 01:53:01 EDT 2022
% Result : Theorem 4.71s 2.26s
% Output : CNFRefutation 4.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 42 ( 4 unt; 0 nHn; 42 RR)
% Number of literals : 80 ( 3 equ; 44 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_2) ).
cnf(i_0_3,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_3) ).
cnf(i_0_59,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_59) ).
cnf(i_0_73,negated_conjecture,
( be(esk4_0,esk10_1(X1),X1,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_73) ).
cnf(i_0_56,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_56) ).
cnf(i_0_37,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_37) ).
cnf(i_0_49,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_49) ).
cnf(i_0_69,negated_conjecture,
( fellow(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_69) ).
cnf(i_0_21,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_21) ).
cnf(i_0_75,negated_conjecture,
( frontseat(esk4_0,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_75) ).
cnf(i_0_16,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_16) ).
cnf(i_0_20,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_20) ).
cnf(i_0_65,plain,
( member(X1,esk2_2(X1,X2),X2)
| ~ two(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_65) ).
cnf(i_0_71,negated_conjecture,
two(esk4_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-inra4d3v/lgb.p',i_0_71) ).
cnf(c_0_91,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
i_0_1 ).
cnf(c_0_92,plain,
( furniture(X1,X2)
| ~ seat(X1,X2) ),
i_0_2 ).
cnf(c_0_93,plain,
( instrumentality(X1,X2)
| ~ seat(X1,X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
( seat(X1,X2)
| ~ frontseat(X1,X2) ),
i_0_3 ).
cnf(c_0_95,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
i_0_59 ).
cnf(c_0_96,negated_conjecture,
( be(esk4_0,esk10_1(X1),X1,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
i_0_73 ).
cnf(c_0_97,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
i_0_56 ).
cnf(c_0_98,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
i_0_37 ).
cnf(c_0_99,plain,
( man(X1,X2)
| ~ fellow(X1,X2) ),
i_0_49 ).
cnf(c_0_100,negated_conjecture,
( fellow(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
i_0_69 ).
cnf(c_0_101,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
i_0_21 ).
cnf(c_0_102,plain,
( instrumentality(X1,X2)
| ~ frontseat(X1,X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_103,negated_conjecture,
( frontseat(esk4_0,esk11_1(X1))
| ~ member(esk4_0,X1,esk9_0) ),
i_0_75 ).
cnf(c_0_104,plain,
( esk11_1(X1) = X1
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_105,plain,
( ~ man(X1,X2)
| ~ unisex(X1,X2) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_106,negated_conjecture,
( man(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_107,plain,
( artifact(X1,X2)
| ~ frontseat(X1,X2) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_108,negated_conjecture,
( frontseat(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
( ~ unisex(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
i_0_16 ).
cnf(c_0_111,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
i_0_20 ).
cnf(c_0_112,negated_conjecture,
( artifact(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_113,plain,
( ~ object(esk4_0,X1)
| ~ member(esk4_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,plain,
~ member(esk4_0,X1,esk9_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]) ).
cnf(c_0_115,plain,
( member(X1,esk2_2(X1,X2),X2)
| ~ two(X1,X2) ),
i_0_65 ).
cnf(c_0_116,negated_conjecture,
two(esk4_0,esk9_0),
i_0_71 ).
cnf(c_0_117,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NLP143+1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 Jun 30 21:56:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 4.71/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.71/2.26 # No SInE strategy applied
% 4.71/2.26 # Trying AutoSched0 for 150 seconds
% 4.71/2.26 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.71/2.26 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.71/2.26 #
% 4.71/2.26 # Preprocessing time : 0.025 s
% 4.71/2.26 # Presaturation interreduction done
% 4.71/2.26
% 4.71/2.26 # Proof found!
% 4.71/2.26 # SZS status Theorem
% 4.71/2.26 # SZS output start CNFRefutation
% See solution above
% 4.71/2.26 # Training examples: 0 positive, 0 negative
% 4.71/2.26
% 4.71/2.26 # -------------------------------------------------
% 4.71/2.26 # User time : 0.033 s
% 4.71/2.26 # System time : 0.006 s
% 4.71/2.26 # Total time : 0.038 s
% 4.71/2.26 # Maximum resident set size: 7124 pages
% 4.71/2.26
%------------------------------------------------------------------------------