TSTP Solution File: NLP204+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NLP204+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:54:01 EDT 2022
% Result : Theorem 7.89s 2.30s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 31 RR)
% Number of literals : 47 ( 3 equ; 19 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
( device(X1,X2)
| ~ wheel(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_48) ).
cnf(i_0_81,negated_conjecture,
wheel(esk4_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_81) ).
cnf(i_0_77,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_77) ).
cnf(i_0_79,negated_conjecture,
be(esk4_0,esk14_0,esk5_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_79) ).
cnf(i_0_47,plain,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_47) ).
cnf(i_0_118,negated_conjecture,
man(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_118) ).
cnf(i_0_46,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_46) ).
cnf(i_0_24,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_24) ).
cnf(i_0_45,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_45) ).
cnf(i_0_63,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_63) ).
cnf(i_0_38,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fzmuy9vn/input.p',i_0_38) ).
cnf(c_0_130,plain,
( device(X1,X2)
| ~ wheel(X1,X2) ),
i_0_48 ).
cnf(c_0_131,negated_conjecture,
wheel(esk4_0,esk15_0),
i_0_81 ).
cnf(c_0_132,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
i_0_77 ).
cnf(c_0_133,negated_conjecture,
be(esk4_0,esk14_0,esk5_0,esk15_0),
i_0_79 ).
cnf(c_0_134,plain,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
i_0_47 ).
cnf(c_0_135,negated_conjecture,
device(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_136,negated_conjecture,
man(esk4_0,esk5_0),
i_0_118 ).
cnf(c_0_137,negated_conjecture,
esk5_0 = esk15_0,
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_138,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
i_0_46 ).
cnf(c_0_139,plain,
instrumentality(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_140,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
i_0_24 ).
cnf(c_0_141,negated_conjecture,
man(esk4_0,esk15_0),
inference(rw,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
i_0_45 ).
cnf(c_0_143,plain,
artifact(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_144,plain,
( ~ unisex(X1,X2)
| ~ male(X1,X2) ),
i_0_63 ).
cnf(c_0_145,negated_conjecture,
male(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_146,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
i_0_38 ).
cnf(c_0_147,plain,
object(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_148,plain,
~ unisex(esk4_0,esk15_0),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_149,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP204+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 08:37:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.89/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.89/2.30 # No SInE strategy applied
% 7.89/2.30 # Trying AutoSched0 for 150 seconds
% 7.89/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.89/2.30 # and selection function SelectCQArNTNpEqFirst.
% 7.89/2.30 #
% 7.89/2.30 # Preprocessing time : 0.015 s
% 7.89/2.30 # Presaturation interreduction done
% 7.89/2.30
% 7.89/2.30 # Proof found!
% 7.89/2.30 # SZS status Theorem
% 7.89/2.30 # SZS output start CNFRefutation
% See solution above
% 7.89/2.30 # Training examples: 0 positive, 0 negative
% 7.89/2.30
% 7.89/2.30 # -------------------------------------------------
% 7.89/2.30 # User time : 0.019 s
% 7.89/2.30 # System time : 0.005 s
% 7.89/2.30 # Total time : 0.024 s
% 7.89/2.30 # Maximum resident set size: 7120 pages
% 7.89/2.30
%------------------------------------------------------------------------------