TSTP Solution File: CSR046+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR046+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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:52 EDT 2023
% Result : Theorem 3.88s 2.02s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 40
% Syntax : Number of formulae : 43 ( 4 unt; 38 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 22 >; 10 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 16 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ natargument > natfunction > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > uniformresourcelocator > transitivebinarypredicate > tptpcol_16_50958 > tptpcol_15_50957 > thing > predicate > mtvisible > microtheory > computerdataartifact > collection > binarypredicate > f_contentmtofcdafromeventfn > #nlpp > f_urlreferentfn > f_urlfn > s_http_wwwfuntriviacomplayquizcfmqid60926origin > n_2 > n_1 > c_urlreferentfn > c_urlfn > c_universalvocabularymt > c_translation_0_885 > c_transitivebinarypredicate > c_tptpcol_16_50958 > c_tptpcol_15_50957 > 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(tptpcol_16_50958,type,
tptpcol_16_50958: $i > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(c_urlfn,type,
c_urlfn: $i ).
tff(c_tptpcol_16_50958,type,
c_tptpcol_16_50958: $i ).
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(s_http_wwwfuntriviacomplayquizcfmqid60926origin,type,
s_http_wwwfuntriviacomplayquizcfmqid60926origin: $i ).
tff(isa,type,
isa: ( $i * $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(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(uniformresourcelocator,type,
uniformresourcelocator: $i > $o ).
tff(thing,type,
thing: $i > $o ).
tff(tptpcol_15_50957,type,
tptpcol_15_50957: $i > $o ).
tff(natfunction,type,
natfunction: ( $i * $i ) > $o ).
tff(computerdataartifact,type,
computerdataartifact: $i > $o ).
tff(c_machinelearningspindleheadmt,type,
c_machinelearningspindleheadmt: $i ).
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(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(c_cycnounlearnermt,type,
c_cycnounlearnermt: $i ).
tff(c_urlreferentfn,type,
c_urlreferentfn: $i ).
tff(c_cycorpproductsmt,type,
c_cycorpproductsmt: $i ).
tff(c_tptpcol_15_50957,type,
c_tptpcol_15_50957: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(f_contentmtofcdafromeventfn,type,
f_contentmtofcdafromeventfn: ( $i * $i ) > $i ).
tff(c_translation_0_885,type,
c_translation_0_885: $i ).
tff(f_304,negated_conjecture,
~ ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwfuntriviacomplayquizcfmqid60926origin)),c_translation_0_885))
=> genls(c_tptpcol_16_50958,c_tptpcol_15_50957) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query46) ).
tff(f_47,axiom,
genls(c_tptpcol_16_50958,c_tptpcol_15_50957),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
tff(c_134,plain,
~ genls(c_tptpcol_16_50958,c_tptpcol_15_50957),
inference(cnfTransformation,[status(thm)],[f_304]) ).
tff(c_14,plain,
genls(c_tptpcol_16_50958,c_tptpcol_15_50957),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_137,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_134,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR046+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 20:48:21 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.88/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.02
% 3.88/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.88/2.06
% 3.88/2.06 Inference rules
% 3.88/2.06 ----------------------
% 3.88/2.06 #Ref : 0
% 3.88/2.06 #Sup : 0
% 3.88/2.06 #Fact : 0
% 3.88/2.06 #Define : 0
% 3.88/2.06 #Split : 0
% 3.88/2.06 #Chain : 0
% 3.88/2.06 #Close : 0
% 3.88/2.06
% 3.88/2.06 Ordering : KBO
% 3.88/2.06
% 3.88/2.06 Simplification rules
% 3.88/2.06 ----------------------
% 3.88/2.06 #Subsume : 67
% 3.88/2.06 #Demod : 0
% 3.88/2.06 #Tautology : 0
% 3.88/2.06 #SimpNegUnit : 1
% 3.88/2.06 #BackRed : 0
% 3.88/2.06
% 3.88/2.06 #Partial instantiations: 0
% 3.88/2.06 #Strategies tried : 1
% 3.88/2.06
% 3.88/2.06 Timing (in seconds)
% 3.88/2.06 ----------------------
% 3.88/2.06 Preprocessing : 0.66
% 3.88/2.06 Parsing : 0.34
% 3.88/2.06 CNF conversion : 0.06
% 3.88/2.06 Main loop : 0.15
% 3.88/2.06 Inferencing : 0.00
% 3.88/2.06 Reduction : 0.07
% 3.88/2.06 Demodulation : 0.05
% 3.88/2.06 BG Simplification : 0.04
% 3.88/2.06 Subsumption : 0.06
% 3.88/2.06 Abstraction : 0.01
% 3.88/2.06 MUC search : 0.00
% 3.88/2.06 Cooper : 0.00
% 3.88/2.06 Total : 0.87
% 3.88/2.06 Index Insertion : 0.00
% 3.88/2.06 Index Deletion : 0.00
% 3.88/2.06 Index Matching : 0.00
% 3.88/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------