TSTP Solution File: CSR066+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR066+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 : n028.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:36:08 EDT 2023
% Result : Theorem 5.78s 2.32s
% Output : CNFRefutation 5.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 58
% Syntax : Number of formulae : 72 ( 8 unt; 51 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 10 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 30 >; 17 *; 0 +; 0 <<)
% Number of predicates : 27 ( 26 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 21 con; 0-4 aty)
% Number of variables : 19 (; 18 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relationexistsall > natargument > tptp_8_271 > resultisaarg > natfunction > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > uniformresourcelocator > transitivebinarypredicate > tptpcol_5_24579 > tptpcol_16_25972 > thing > shavingrazor_manual > razor > predicate > positiveinteger > mtvisible > microtheory > function_denotational > computerdataartifact > collection > binarypredicate > f_relationexistsallfn > f_contentmtofcdafromeventfn > #nlpp > f_urlreferentfn > f_urlfn > s_http_webnjiteducjohnsontreebiochhtm > n_4 > n_3 > n_2 > n_1 > c_urlreferentfn > c_urlfn > c_universalvocabularymt > c_translation_21 > c_transitivebinarypredicate > c_tptpcol_16_25972 > c_tptp_8_271 > c_theprototypicalshavingrazor_manual > c_shavingrazor_manual > c_relationexistsallfn > c_machinelearningspindleheadmt > c_genlmt > c_cycorpproductsmt > c_cycnounlearnermt > c_contentmtofcdafromeventfn > c_basekb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_urlreferentfn,type,
f_urlreferentfn: $i > $i ).
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(microtheory,type,
microtheory: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(c_urlfn,type,
c_urlfn: $i ).
tff(n_4,type,
n_4: $i ).
tff(function_denotational,type,
function_denotational: $i > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(f_urlfn,type,
f_urlfn: $i > $i ).
tff(c_genlmt,type,
c_genlmt: $i ).
tff(c_tptpcol_16_25972,type,
c_tptpcol_16_25972: $i ).
tff(relationexistsall,type,
relationexistsall: ( $i * $i * $i ) > $o ).
tff(c_relationexistsallfn,type,
c_relationexistsallfn: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(shavingrazor_manual,type,
shavingrazor_manual: $i > $o ).
tff(c_transitivebinarypredicate,type,
c_transitivebinarypredicate: $i ).
tff(c_contentmtofcdafromeventfn,type,
c_contentmtofcdafromeventfn: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(n_2,type,
n_2: $i ).
tff(c_shavingrazor_manual,type,
c_shavingrazor_manual: $i ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(uniformresourcelocator,type,
uniformresourcelocator: $i > $o ).
tff(f_relationexistsallfn,type,
f_relationexistsallfn: ( $i * $i * $i * $i ) > $i ).
tff(c_theprototypicalshavingrazor_manual,type,
c_theprototypicalshavingrazor_manual: $i ).
tff(thing,type,
thing: $i > $o ).
tff(razor,type,
razor: $i > $o ).
tff(natfunction,type,
natfunction: ( $i * $i ) > $o ).
tff(computerdataartifact,type,
computerdataartifact: $i > $o ).
tff(c_machinelearningspindleheadmt,type,
c_machinelearningspindleheadmt: $i ).
tff(positiveinteger,type,
positiveinteger: $i > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(n_1,type,
n_1: $i ).
tff(natargument,type,
natargument: ( $i * $i * $i ) > $o ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(c_translation_21,type,
c_translation_21: $i ).
tff(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(n_3,type,
n_3: $i ).
tff(c_cycnounlearnermt,type,
c_cycnounlearnermt: $i ).
tff(c_urlreferentfn,type,
c_urlreferentfn: $i ).
tff(c_cycorpproductsmt,type,
c_cycorpproductsmt: $i ).
tff(tptpcol_5_24579,type,
tptpcol_5_24579: $i > $o ).
tff(resultisaarg,type,
resultisaarg: ( $i * $i ) > $o ).
tff(c_tptp_8_271,type,
c_tptp_8_271: $i ).
tff(tptp_8_271,type,
tptp_8_271: ( $i * $i ) > $o ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(f_contentmtofcdafromeventfn,type,
f_contentmtofcdafromeventfn: ( $i * $i ) > $i ).
tff(tptpcol_16_25972,type,
tptpcol_16_25972: $i > $o ).
tff(s_http_webnjiteducjohnsontreebiochhtm,type,
s_http_webnjiteducjohnsontreebiochhtm: $i ).
tff(f_61,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).
tff(f_162,axiom,
! [X] :
( shavingrazor_manual(X)
=> isa(X,c_shavingrazor_manual) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just31) ).
tff(f_59,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just10) ).
tff(f_46,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',just4) ).
tff(f_167,axiom,
! [X] :
( isa(X,c_tptpcol_16_25972)
=> tptpcol_16_25972(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just32) ).
tff(f_58,axiom,
! [TERM] :
( shavingrazor_manual(TERM)
=> tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).
tff(f_318,negated_conjecture,
~ ? [X] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query66) ).
tff(c_22,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_62,plain,
! [X_48] :
( isa(X_48,c_shavingrazor_manual)
| ~ shavingrazor_manual(X_48) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_20,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_1218,plain,
! [TERM_366,PRED_367,DEPCOL_368,INDEPCOL_369] :
( isa(f_relationexistsallfn(TERM_366,PRED_367,DEPCOL_368,INDEPCOL_369),DEPCOL_368)
| ~ relationexistsall(PRED_367,DEPCOL_368,INDEPCOL_369)
| ~ isa(TERM_366,INDEPCOL_369) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_64,plain,
! [X_49] :
( tptpcol_16_25972(X_49)
| ~ isa(X_49,c_tptpcol_16_25972) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_1595,plain,
! [TERM_380,PRED_381,INDEPCOL_382] :
( tptpcol_16_25972(f_relationexistsallfn(TERM_380,PRED_381,c_tptpcol_16_25972,INDEPCOL_382))
| ~ relationexistsall(PRED_381,c_tptpcol_16_25972,INDEPCOL_382)
| ~ isa(TERM_380,INDEPCOL_382) ),
inference(resolution,[status(thm)],[c_1218,c_64]) ).
tff(c_896,plain,
! [TERM_328] :
( tptp_8_271(f_relationexistsallfn(TERM_328,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM_328)
| ~ shavingrazor_manual(TERM_328) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_150,plain,
! [X_134] :
( ~ tptpcol_16_25972(X_134)
| ~ tptp_8_271(X_134,c_theprototypicalshavingrazor_manual) ),
inference(cnfTransformation,[status(thm)],[f_318]) ).
tff(c_906,plain,
( ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual))
| ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual) ),
inference(resolution,[status(thm)],[c_896,c_150]) ).
tff(c_911,plain,
~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_906]) ).
tff(c_1598,plain,
( ~ relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)
| ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual) ),
inference(resolution,[status(thm)],[c_1595,c_911]) ).
tff(c_1604,plain,
~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_1598]) ).
tff(c_1609,plain,
~ shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(resolution,[status(thm)],[c_62,c_1604]) ).
tff(c_1613,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_1609]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR066+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:56:24 EDT 2023
% 0.15/0.37 % CPUTime :
% 5.78/2.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.78/2.32
% 5.78/2.32 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.90/2.35
% 5.90/2.35 Inference rules
% 5.90/2.35 ----------------------
% 5.90/2.35 #Ref : 0
% 5.90/2.35 #Sup : 292
% 5.90/2.35 #Fact : 0
% 5.90/2.35 #Define : 0
% 5.90/2.35 #Split : 16
% 5.90/2.35 #Chain : 0
% 5.90/2.35 #Close : 0
% 5.90/2.35
% 5.90/2.35 Ordering : KBO
% 5.90/2.35
% 5.90/2.35 Simplification rules
% 5.90/2.35 ----------------------
% 5.90/2.35 #Subsume : 47
% 5.90/2.35 #Demod : 190
% 5.90/2.35 #Tautology : 150
% 5.90/2.35 #SimpNegUnit : 13
% 5.90/2.35 #BackRed : 11
% 5.90/2.35
% 5.90/2.35 #Partial instantiations: 0
% 5.90/2.35 #Strategies tried : 1
% 5.90/2.35
% 5.90/2.35 Timing (in seconds)
% 5.90/2.35 ----------------------
% 5.90/2.36 Preprocessing : 0.58
% 5.90/2.36 Parsing : 0.33
% 5.90/2.36 CNF conversion : 0.04
% 5.90/2.36 Main loop : 0.68
% 5.90/2.36 Inferencing : 0.26
% 5.90/2.36 Reduction : 0.21
% 5.90/2.36 Demodulation : 0.15
% 5.90/2.36 BG Simplification : 0.03
% 5.90/2.36 Subsumption : 0.12
% 5.90/2.36 Abstraction : 0.02
% 5.90/2.36 MUC search : 0.00
% 5.90/2.36 Cooper : 0.00
% 5.90/2.36 Total : 1.31
% 5.90/2.36 Index Insertion : 0.00
% 5.90/2.36 Index Deletion : 0.00
% 5.90/2.36 Index Matching : 0.00
% 5.90/2.36 BG Taut test : 0.00
%------------------------------------------------------------------------------