TSTP Solution File: CSR045+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR045+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Fri Jul 15 02:46:56 EDT 2022
% Result : Theorem 7.56s 2.27s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 7 unt; 0 nHn; 25 RR)
% Number of literals : 43 ( 0 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( intangibleindividual(X1)
| ~ aspatialinformationstore(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_8) ).
cnf(i_0_3,plain,
( aspatialinformationstore(X1)
| ~ microtheory(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_3) ).
cnf(i_0_6,plain,
( partiallyintangibleindividual(X1)
| ~ intangibleindividual(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_6) ).
cnf(i_0_10,plain,
( individual(X1)
| ~ partiallyintangibleindividual(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_10) ).
cnf(i_0_15,plain,
( ~ individual(X1)
| ~ collection(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_15) ).
cnf(i_0_14,plain,
( microtheory(X1)
| ~ applicationcontext(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_14) ).
cnf(i_0_1,plain,
applicationcontext(c_wamt_evalinitial_p14),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_1) ).
cnf(i_0_71,plain,
( collection(X1)
| ~ genls(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_71) ).
cnf(i_0_85,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ebsc3izj/lgb.p',i_0_85) ).
cnf(c_0_95,plain,
( intangibleindividual(X1)
| ~ aspatialinformationstore(X1) ),
i_0_8 ).
cnf(c_0_96,plain,
( aspatialinformationstore(X1)
| ~ microtheory(X1) ),
i_0_3 ).
cnf(c_0_97,plain,
( partiallyintangibleindividual(X1)
| ~ intangibleindividual(X1) ),
i_0_6 ).
cnf(c_0_98,plain,
( intangibleindividual(X1)
| ~ microtheory(X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,plain,
( individual(X1)
| ~ partiallyintangibleindividual(X1) ),
i_0_10 ).
cnf(c_0_100,plain,
( partiallyintangibleindividual(X1)
| ~ microtheory(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( ~ individual(X1)
| ~ collection(X1) ),
i_0_15 ).
cnf(c_0_102,plain,
( individual(X1)
| ~ microtheory(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
( microtheory(X1)
| ~ applicationcontext(X1) ),
i_0_14 ).
cnf(c_0_104,plain,
applicationcontext(c_wamt_evalinitial_p14),
i_0_1 ).
cnf(c_0_105,plain,
( collection(X1)
| ~ genls(X1,X2) ),
i_0_71 ).
cnf(c_0_106,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
i_0_85 ).
cnf(c_0_107,plain,
( ~ microtheory(X1)
| ~ collection(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_108,plain,
microtheory(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
collection(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR045+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Fri Jun 10 18:08:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.56/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.56/2.27 # No SInE strategy applied
% 7.56/2.27 # Trying AutoSched0 for 150 seconds
% 7.56/2.27 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.56/2.27 # and selection function SelectNewComplexAHP.
% 7.56/2.27 #
% 7.56/2.27 # Preprocessing time : 0.013 s
% 7.56/2.27
% 7.56/2.27 # Proof found!
% 7.56/2.27 # SZS status Theorem
% 7.56/2.27 # SZS output start CNFRefutation
% See solution above
% 7.56/2.27 # Training examples: 0 positive, 0 negative
% 7.56/2.27
% 7.56/2.27 # -------------------------------------------------
% 7.56/2.27 # User time : 0.014 s
% 7.56/2.27 # System time : 0.004 s
% 7.56/2.27 # Total time : 0.018 s
% 7.56/2.27 # Maximum resident set size: 7120 pages
% 7.56/2.27
%------------------------------------------------------------------------------