TSTP Solution File: CSR073+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR073+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 : n007.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:15 EDT 2023
% Result : Theorem 4.21s 2.03s
% Output : CNFRefutation 4.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 47
% Syntax : Number of formulae : 66 ( 13 unt; 39 typ; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 11 ~; 8 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 21 >; 11 *; 0 +; 0 <<)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 18 con; 0-0 aty)
% Number of variables : 22 (; 21 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ tptptypes_9_401 > tptptypes_8_400 > tptptypes_7_396 > tptptypes_6_388 > tptptypes_5_387 > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_16_10258 > thing > pushingababycarriage > predicate > mtvisible > microtheory > firstordercollection > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_transitivebinarypredicate > c_tptptypes_9_401 > c_tptptypes_8_400 > c_tptptypes_7_396 > c_tptptypes_6_388 > c_tptptypes_5_387 > c_tptpcol_16_10258 > c_tptp_spindleheadmt > c_tptp_spindlecollectormt > c_tptp_member3993_mt > c_tptp_member237_mt > c_pushingababycarriage > c_genlmt > c_cyclistsmt > c_calendarsvocabularymt > c_calendarsmt > c_basekb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_tptptypes_7_396,type,
c_tptptypes_7_396: $i ).
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(microtheory,type,
microtheory: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(firstordercollection,type,
firstordercollection: $i > $o ).
tff(c_pushingababycarriage,type,
c_pushingababycarriage: $i ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(tptptypes_7_396,type,
tptptypes_7_396: ( $i * $i ) > $o ).
tff(tptptypes_6_388,type,
tptptypes_6_388: ( $i * $i ) > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(pushingababycarriage,type,
pushingababycarriage: $i > $o ).
tff(c_calendarsmt,type,
c_calendarsmt: $i ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(c_tptptypes_6_388,type,
c_tptptypes_6_388: $i ).
tff(c_genlmt,type,
c_genlmt: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(c_tptp_member237_mt,type,
c_tptp_member237_mt: $i ).
tff(c_transitivebinarypredicate,type,
c_transitivebinarypredicate: $i ).
tff(tptpcol_16_10258,type,
tptpcol_16_10258: $i > $o ).
tff(c_tptptypes_5_387,type,
c_tptptypes_5_387: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(tptptypes_9_401,type,
tptptypes_9_401: ( $i * $i ) > $o ).
tff(c_cyclistsmt,type,
c_cyclistsmt: $i ).
tff(c_calendarsvocabularymt,type,
c_calendarsvocabularymt: $i ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(c_tptp_member3993_mt,type,
c_tptp_member3993_mt: $i ).
tff(c_tptpcol_16_10258,type,
c_tptpcol_16_10258: $i ).
tff(thing,type,
thing: $i > $o ).
tff(c_tptptypes_9_401,type,
c_tptptypes_9_401: $i ).
tff(c_tptptypes_8_400,type,
c_tptptypes_8_400: $i ).
tff(c_tptp_spindleheadmt,type,
c_tptp_spindleheadmt: $i ).
tff(c_basekb,type,
c_basekb: $i ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(tptptypes_5_387,type,
tptptypes_5_387: ( $i * $i ) > $o ).
tff(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(tptptypes_8_400,type,
tptptypes_8_400: ( $i * $i ) > $o ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(c_tptp_spindlecollectormt,type,
c_tptp_spindlecollectormt: $i ).
tff(f_312,negated_conjecture,
~ ? [ARG1] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(ARG1,c_pushingababycarriage) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query73) ).
tff(f_79,axiom,
( mtvisible(c_tptp_member237_mt)
=> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just18) ).
tff(f_71,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just15) ).
tff(f_275,axiom,
! [SPECMT,GENLMT] :
( ( mtvisible(SPECMT)
& genlmt(SPECMT,GENLMT) )
=> mtvisible(GENLMT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just59) ).
tff(f_67,axiom,
! [ARG1,ARG2] :
( tptptypes_9_401(ARG1,ARG2)
=> tptptypes_8_400(ARG2,ARG1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just13) ).
tff(f_61,axiom,
! [ARG1,ARG2] :
( tptptypes_8_400(ARG1,ARG2)
=> tptptypes_7_396(ARG1,ARG2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).
tff(f_55,axiom,
! [ARG1,ARG2] :
( tptptypes_7_396(ARG1,ARG2)
=> tptptypes_6_388(ARG1,ARG2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).
tff(f_49,axiom,
! [ARG1,ARG2] :
( tptptypes_6_388(ARG1,ARG2)
=> tptptypes_5_387(ARG1,ARG2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
tff(c_138,plain,
! [ARG1_102] : ~ tptptypes_5_387(ARG1_102,c_pushingababycarriage),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_36,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_242,plain,
~ mtvisible(c_tptp_member237_mt),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_136,plain,
mtvisible(c_tptp_spindlecollectormt),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_30,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_335,plain,
! [GENLMT_166,SPECMT_167] :
( mtvisible(GENLMT_166)
| ~ genlmt(SPECMT_167,GENLMT_166)
| ~ mtvisible(SPECMT_167) ),
inference(cnfTransformation,[status(thm)],[f_275]) ).
tff(c_347,plain,
( mtvisible(c_tptp_member237_mt)
| ~ mtvisible(c_tptp_spindlecollectormt) ),
inference(resolution,[status(thm)],[c_30,c_335]) ).
tff(c_370,plain,
mtvisible(c_tptp_member237_mt),
inference(demodulation,[status(thm),theory(equality)],[c_136,c_347]) ).
tff(c_372,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_242,c_370]) ).
tff(c_373,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_470,plain,
! [ARG2_185,ARG1_186] :
( tptptypes_8_400(ARG2_185,ARG1_186)
| ~ tptptypes_9_401(ARG1_186,ARG2_185) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_474,plain,
tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage),
inference(resolution,[status(thm)],[c_373,c_470]) ).
tff(c_486,plain,
! [ARG1_189,ARG2_190] :
( tptptypes_7_396(ARG1_189,ARG2_190)
| ~ tptptypes_8_400(ARG1_189,ARG2_190) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_490,plain,
tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
inference(resolution,[status(thm)],[c_474,c_486]) ).
tff(c_501,plain,
! [ARG1_191,ARG2_192] :
( tptptypes_6_388(ARG1_191,ARG2_192)
| ~ tptptypes_7_396(ARG1_191,ARG2_192) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_505,plain,
tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage),
inference(resolution,[status(thm)],[c_490,c_501]) ).
tff(c_516,plain,
! [ARG1_193,ARG2_194] :
( tptptypes_5_387(ARG1_193,ARG2_194)
| ~ tptptypes_6_388(ARG1_193,ARG2_194) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_519,plain,
tptptypes_5_387(c_tptpcol_16_10258,c_pushingababycarriage),
inference(resolution,[status(thm)],[c_505,c_516]) ).
tff(c_523,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_138,c_519]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR073+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.19/0.36 % Computer : n007.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 20:37:54 EDT 2023
% 0.19/0.36 % CPUTime :
% 4.21/2.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.21/2.04
% 4.21/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.59/2.07
% 4.59/2.07 Inference rules
% 4.59/2.07 ----------------------
% 4.59/2.07 #Ref : 0
% 4.59/2.07 #Sup : 73
% 4.59/2.07 #Fact : 0
% 4.59/2.07 #Define : 0
% 4.59/2.07 #Split : 4
% 4.59/2.07 #Chain : 0
% 4.59/2.07 #Close : 0
% 4.59/2.07
% 4.59/2.07 Ordering : KBO
% 4.59/2.07
% 4.59/2.07 Simplification rules
% 4.59/2.07 ----------------------
% 4.59/2.07 #Subsume : 11
% 4.59/2.07 #Demod : 26
% 4.59/2.07 #Tautology : 34
% 4.59/2.07 #SimpNegUnit : 6
% 4.59/2.07 #BackRed : 2
% 4.59/2.07
% 4.59/2.07 #Partial instantiations: 0
% 4.59/2.07 #Strategies tried : 1
% 4.59/2.07
% 4.59/2.07 Timing (in seconds)
% 4.59/2.07 ----------------------
% 4.59/2.07 Preprocessing : 0.56
% 4.59/2.07 Parsing : 0.32
% 4.59/2.07 CNF conversion : 0.04
% 4.59/2.07 Main loop : 0.43
% 4.59/2.07 Inferencing : 0.16
% 4.59/2.07 Reduction : 0.12
% 4.59/2.07 Demodulation : 0.08
% 4.59/2.07 BG Simplification : 0.03
% 4.59/2.07 Subsumption : 0.08
% 4.59/2.07 Abstraction : 0.01
% 4.59/2.07 MUC search : 0.00
% 4.59/2.07 Cooper : 0.00
% 4.59/2.07 Total : 1.04
% 4.59/2.07 Index Insertion : 0.00
% 4.59/2.07 Index Deletion : 0.00
% 4.59/2.07 Index Matching : 0.00
% 4.59/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------