TSTP Solution File: CSR038+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR038+6 : TPTP v8.1.0. Bugfixed v5.3.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 : Fri Jul 15 02:46:50 EDT 2022
% Result : Theorem 71.65s 66.33s
% Output : CNFRefutation 71.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 6 unt; 0 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3704,negated_conjecture,
( ~ tptpcol_16_7738(X1)
| ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_3704) ).
cnf(i_0_2409,plain,
( tptpcol_16_7738(X1)
| ~ isa(X1,c_tptpcol_16_7738) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_2409) ).
cnf(i_0_3201,plain,
( tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)
| ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_3201) ).
cnf(i_0_1778,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_1778) ).
cnf(i_0_3300,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_3300) ).
cnf(i_0_3202,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d1jkfwwy/lgb.p',i_0_3202) ).
cnf(c_0_3711,negated_conjecture,
( ~ tptpcol_16_7738(X1)
| ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
i_0_3704 ).
cnf(c_0_3712,plain,
( tptpcol_16_7738(X1)
| ~ isa(X1,c_tptpcol_16_7738) ),
i_0_2409 ).
cnf(c_0_3713,negated_conjecture,
( ~ isa(X1,c_tptpcol_16_7738)
| ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
inference(spm,[status(thm)],[c_0_3711,c_0_3712]) ).
cnf(c_0_3714,plain,
( tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)
| ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
i_0_3201 ).
cnf(c_0_3715,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
i_0_1778 ).
cnf(c_0_3716,negated_conjecture,
~ isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3713,c_0_3714]),c_0_3715])]) ).
cnf(c_0_3717,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
i_0_3300 ).
cnf(c_0_3718,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
i_0_3202 ).
cnf(c_0_3719,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3716,c_0_3717]),c_0_3718]),c_0_3715])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR038+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.03/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 : Fri Jun 10 05:37:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 62.92/63.13 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 62.92/63.13 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 62.92/63.13 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 62.92/63.13 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 71.65/66.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 71.65/66.33 # No SInE strategy applied
% 71.65/66.33 # Trying AutoSched0 for 118 seconds
% 71.65/66.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 71.65/66.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 71.65/66.33 #
% 71.65/66.33 # Preprocessing time : 0.022 s
% 71.65/66.33 # Presaturation interreduction done
% 71.65/66.33
% 71.65/66.33 # Proof found!
% 71.65/66.33 # SZS status Theorem
% 71.65/66.33 # SZS output start CNFRefutation
% See solution above
% 71.65/66.33 # Training examples: 0 positive, 0 negative
% 71.65/66.33
% 71.65/66.33 # -------------------------------------------------
% 71.65/66.33 # User time : 0.027 s
% 71.65/66.33 # System time : 0.007 s
% 71.65/66.33 # Total time : 0.034 s
% 71.65/66.33 # Maximum resident set size: 7124 pages
% 71.65/66.33
%------------------------------------------------------------------------------