TSTP Solution File: PHI014+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 16:45:05 EDT 2022
% Result : Theorem 4.61s 2.27s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 5 unt; 9 nHn; 25 RR)
% Number of literals : 75 ( 0 equ; 45 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 32 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( exemplifies_property(X1,X2)
| ~ property(X1)
| ~ object(X2)
| ~ object(X3)
| ~ is_the(X2,X1)
| ~ is_the(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( object(X1)
| ~ is_the(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_2) ).
cnf(i_0_3,plain,
( property(X1)
| ~ is_the(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_3) ).
cnf(i_0_10,plain,
( exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk2_1(X1),X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_10) ).
cnf(i_0_12,plain,
is_the(god,none_greater),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_12) ).
cnf(i_0_9,plain,
( exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk2_1(X1))
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
( object(esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_11) ).
cnf(i_0_7,plain,
( ~ object(X1)
| ~ object(X2)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_7) ).
cnf(i_0_13,negated_conjecture,
~ exemplifies_property(existence,god),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8tzpcrns/lgb.p',i_0_13) ).
cnf(c_0_23,plain,
( exemplifies_property(X1,X2)
| ~ property(X1)
| ~ object(X2)
| ~ object(X3)
| ~ is_the(X2,X1)
| ~ is_the(X3,X1) ),
i_0_1 ).
cnf(c_0_24,plain,
( object(X1)
| ~ is_the(X1,X2) ),
i_0_2 ).
cnf(c_0_25,plain,
( property(X1)
| ~ is_the(X2,X1) ),
i_0_3 ).
cnf(c_0_26,plain,
( exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk2_1(X1),X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
i_0_10 ).
cnf(c_0_27,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X3,X1)
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
is_the(god,none_greater),
i_0_12 ).
cnf(c_0_29,plain,
( exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk2_1(X1))
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
i_0_9 ).
cnf(c_0_30,plain,
( object(esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ object(X1)
| ~ is_the(X1,none_greater) ),
i_0_11 ).
cnf(c_0_31,plain,
( ~ object(X1)
| ~ object(X2)
| ~ exemplifies_property(none_greater,X1)
| ~ exemplifies_property(conceivable,X2)
| ~ exemplifies_relation(greater_than,X2,X1) ),
i_0_7 ).
cnf(c_0_32,plain,
( exemplifies_relation(greater_than,esk2_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_33,plain,
( exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( exemplifies_property(conceivable,esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_35,plain,
( object(esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,plain,
( exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_24]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
~ exemplifies_property(existence,god),
i_0_13 ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 2 01:19:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.61/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.61/2.27 # No SInE strategy applied
% 4.61/2.27 # Trying AutoSched0 for 150 seconds
% 4.61/2.27 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.61/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.61/2.27 #
% 4.61/2.27 # Preprocessing time : 0.022 s
% 4.61/2.27
% 4.61/2.27 # Proof found!
% 4.61/2.27 # SZS status Theorem
% 4.61/2.27 # SZS output start CNFRefutation
% See solution above
% 4.61/2.27 # Training examples: 0 positive, 0 negative
% 4.61/2.27
% 4.61/2.27 # -------------------------------------------------
% 4.61/2.27 # User time : 0.024 s
% 4.61/2.27 # System time : 0.005 s
% 4.61/2.27 # Total time : 0.029 s
% 4.61/2.27 # Maximum resident set size: 7124 pages
% 4.61/2.27
%------------------------------------------------------------------------------