TSTP Solution File: CSR038+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR038+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n006.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 : 300s
% DateTime : Tue Aug 22 10:35:46 EDT 2023
% Result : Theorem 4.55s 2.20s
% Output : CNFRefutation 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 53
% Syntax : Number of formulae : 64 ( 6 unt; 47 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 14 ~; 9 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 49 ( 30 >; 19 *; 0 +; 0 <<)
% Number of predicates : 29 ( 28 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 17 con; 0-4 aty)
% Number of variables : 17 (; 16 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relationexistsall > natargument > tptp_8_968 > resultisaarg > products > natfunction > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_7_7172 > tptpcol_16_7738 > thing > subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription > predicate > positiveinteger > mtvisible > microtheory > issuingaprescription > function_denotational > creationordestructionevent > correctivelensprescription > collection > binarypredicate > artifact > f_relationexistsallfn > f_subcollectionofwithrelationtotypefn > #nlpp > n_4 > n_3 > n_2 > n_1 > c_universalvocabularymt > c_transitivebinarypredicate > c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804 > c_tptpcol_16_7738 > c_tptp_8_968 > c_subcollectionofwithrelationtotypefn > c_relationexistsallfn > c_products > c_knowledgefragmentd3mt > c_issuingaprescription > c_genlmt > c_correctivelensprescription > c_basekb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(microtheory,type,
microtheory: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(c_issuingaprescription,type,
c_issuingaprescription: $i ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(n_4,type,
n_4: $i ).
tff(function_denotational,type,
function_denotational: $i > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(artifact,type,
artifact: $i > $o ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(issuingaprescription,type,
issuingaprescription: $i > $o ).
tff(c_genlmt,type,
c_genlmt: $i ).
tff(relationexistsall,type,
relationexistsall: ( $i * $i * $i ) > $o ).
tff(c_relationexistsallfn,type,
c_relationexistsallfn: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(products,type,
products: ( $i * $i ) > $o ).
tff(f_subcollectionofwithrelationtotypefn,type,
f_subcollectionofwithrelationtotypefn: ( $i * $i * $i ) > $i ).
tff(c_transitivebinarypredicate,type,
c_transitivebinarypredicate: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(c_products,type,
c_products: $i ).
tff(n_2,type,
n_2: $i ).
tff(c_tptp_8_968,type,
c_tptp_8_968: $i ).
tff(tptp_8_968,type,
tptp_8_968: ( $i * $i ) > $o ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(c_tptpcol_16_7738,type,
c_tptpcol_16_7738: $i ).
tff(f_relationexistsallfn,type,
f_relationexistsallfn: ( $i * $i * $i * $i ) > $i ).
tff(thing,type,
thing: $i > $o ).
tff(natfunction,type,
natfunction: ( $i * $i ) > $o ).
tff(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,type,
c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804: $i ).
tff(positiveinteger,type,
positiveinteger: $i > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(n_1,type,
n_1: $i ).
tff(correctivelensprescription,type,
correctivelensprescription: $i > $o ).
tff(c_correctivelensprescription,type,
c_correctivelensprescription: $i ).
tff(c_knowledgefragmentd3mt,type,
c_knowledgefragmentd3mt: $i ).
tff(natargument,type,
natargument: ( $i * $i * $i ) > $o ).
tff(tptpcol_16_7738,type,
tptpcol_16_7738: $i > $o ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(c_subcollectionofwithrelationtotypefn,type,
c_subcollectionofwithrelationtotypefn: $i ).
tff(n_3,type,
n_3: $i ).
tff(creationordestructionevent,type,
creationordestructionevent: $i > $o ).
tff(tptpcol_7_7172,type,
tptpcol_7_7172: $i > $o ).
tff(resultisaarg,type,
resultisaarg: ( $i * $i ) > $o ).
tff(subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription,type,
subcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription: $i > $o ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(f_55,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).
tff(f_53,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).
tff(f_40,axiom,
! [TERM,INDEPCOL,PRED,DEPCOL] :
( ( isa(TERM,INDEPCOL)
& relationexistsall(PRED,DEPCOL,INDEPCOL) )
=> isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
tff(f_200,axiom,
! [X] :
( isa(X,c_tptpcol_16_7738)
=> tptpcol_16_7738(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just41) ).
tff(f_52,axiom,
! [TERM] :
( isa(TERM,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
=> tptp_8_968(f_relationexistsallfn(TERM,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),TERM) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just6) ).
tff(f_328,negated_conjecture,
~ ? [X] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query38) ).
tff(c_16,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_14,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_742,plain,
! [TERM_389,PRED_390,DEPCOL_391,INDEPCOL_392] :
( isa(f_relationexistsallfn(TERM_389,PRED_390,DEPCOL_391,INDEPCOL_392),DEPCOL_391)
| ~ relationexistsall(PRED_390,DEPCOL_391,INDEPCOL_392)
| ~ isa(TERM_389,INDEPCOL_392) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_82,plain,
! [X_72] :
( tptpcol_16_7738(X_72)
| ~ isa(X_72,c_tptpcol_16_7738) ),
inference(cnfTransformation,[status(thm)],[f_200]) ).
tff(c_905,plain,
! [TERM_406,PRED_407,INDEPCOL_408] :
( tptpcol_16_7738(f_relationexistsallfn(TERM_406,PRED_407,c_tptpcol_16_7738,INDEPCOL_408))
| ~ relationexistsall(PRED_407,c_tptpcol_16_7738,INDEPCOL_408)
| ~ isa(TERM_406,INDEPCOL_408) ),
inference(resolution,[status(thm)],[c_742,c_82]) ).
tff(c_855,plain,
! [TERM_394] :
( tptp_8_968(f_relationexistsallfn(TERM_394,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),TERM_394)
| ~ isa(TERM_394,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_148,plain,
! [X_143] :
( ~ tptpcol_16_7738(X_143)
| ~ tptp_8_968(X_143,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804) ),
inference(cnfTransformation,[status(thm)],[f_328]) ).
tff(c_865,plain,
( ~ tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))
| ~ isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(resolution,[status(thm)],[c_855,c_148]) ).
tff(c_870,plain,
~ tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_865]) ).
tff(c_908,plain,
( ~ relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| ~ isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(resolution,[status(thm)],[c_905,c_870]) ).
tff(c_915,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_14,c_908]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR038+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:01:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.55/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.55/2.20
% 4.55/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.55/2.23
% 4.55/2.23 Inference rules
% 4.55/2.23 ----------------------
% 4.55/2.23 #Ref : 0
% 4.55/2.23 #Sup : 146
% 4.55/2.23 #Fact : 0
% 4.55/2.23 #Define : 0
% 4.55/2.23 #Split : 7
% 4.55/2.23 #Chain : 0
% 4.55/2.23 #Close : 0
% 4.55/2.23
% 4.55/2.23 Ordering : KBO
% 4.55/2.23
% 4.55/2.23 Simplification rules
% 4.55/2.23 ----------------------
% 4.55/2.23 #Subsume : 38
% 4.55/2.23 #Demod : 67
% 4.55/2.23 #Tautology : 74
% 4.55/2.23 #SimpNegUnit : 8
% 4.55/2.23 #BackRed : 8
% 4.55/2.23
% 4.55/2.23 #Partial instantiations: 0
% 4.55/2.23 #Strategies tried : 1
% 4.55/2.23
% 4.55/2.23 Timing (in seconds)
% 4.55/2.23 ----------------------
% 4.55/2.23 Preprocessing : 0.61
% 4.55/2.23 Parsing : 0.34
% 4.55/2.24 CNF conversion : 0.04
% 4.55/2.24 Main loop : 0.55
% 4.55/2.24 Inferencing : 0.21
% 4.55/2.24 Reduction : 0.15
% 4.55/2.24 Demodulation : 0.11
% 4.55/2.24 BG Simplification : 0.03
% 4.55/2.24 Subsumption : 0.10
% 4.55/2.24 Abstraction : 0.02
% 4.55/2.24 MUC search : 0.00
% 4.55/2.24 Cooper : 0.00
% 4.55/2.24 Total : 1.21
% 4.55/2.24 Index Insertion : 0.00
% 4.55/2.24 Index Deletion : 0.00
% 4.55/2.24 Index Matching : 0.00
% 4.55/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------