TSTP Solution File: CSR048+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR048+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 : n017.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:54 EDT 2023
% Result : Theorem 3.65s 1.82s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 24
% Syntax : Number of formulae : 33 ( 7 unt; 20 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 14 >; 7 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 6 (; 5 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ isa > genls > genlpreds > genlmt > genlinverse > disjointwith > borderson > thing > predicate > mtvisible > microtheory > geographicalregion > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_tptpgeo_spindlecollectormt > c_tptpgeo_member1_mt > c_georegion_l4_x45_y9 > c_georegion_l4_x45_y10 > 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(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(borderson,type,
borderson: ( $i * $i ) > $o ).
tff(geographicalregion,type,
geographicalregion: $i > $o ).
tff(c_tptpgeo_spindlecollectormt,type,
c_tptpgeo_spindlecollectormt: $i ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(predicate,type,
predicate: $i > $o ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(c_georegion_l4_x45_y10,type,
c_georegion_l4_x45_y10: $i ).
tff(thing,type,
thing: $i > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(c_georegion_l4_x45_y9,type,
c_georegion_l4_x45_y9: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(c_tptpgeo_member1_mt,type,
c_tptpgeo_member1_mt: $i ).
tff(f_216,negated_conjecture,
~ ? [ARG2] :
( mtvisible(c_tptpgeo_spindlecollectormt)
=> borderson(c_georegion_l4_x45_y9,ARG2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query48) ).
tff(f_39,axiom,
( mtvisible(c_tptpgeo_member1_mt)
=> borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just2) ).
tff(f_35,axiom,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).
tff(f_179,axiom,
! [SPECMT,GENLMT] :
( ( mtvisible(SPECMT)
& genlmt(SPECMT,GENLMT) )
=> mtvisible(GENLMT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just31) ).
tff(c_82,plain,
! [ARG2_75] : ~ borderson(c_georegion_l4_x45_y9,ARG2_75),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_4,plain,
( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_83,plain,
~ mtvisible(c_tptpgeo_member1_mt),
inference(negUnitSimplification,[status(thm)],[c_82,c_4]) ).
tff(c_80,plain,
mtvisible(c_tptpgeo_spindlecollectormt),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_2,plain,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_126,plain,
! [GENLMT_108,SPECMT_109] :
( mtvisible(GENLMT_108)
| ~ genlmt(SPECMT_109,GENLMT_108)
| ~ mtvisible(SPECMT_109) ),
inference(cnfTransformation,[status(thm)],[f_179]) ).
tff(c_132,plain,
( mtvisible(c_tptpgeo_member1_mt)
| ~ mtvisible(c_tptpgeo_spindlecollectormt) ),
inference(resolution,[status(thm)],[c_2,c_126]) ).
tff(c_136,plain,
mtvisible(c_tptpgeo_member1_mt),
inference(demodulation,[status(thm),theory(equality)],[c_80,c_132]) ).
tff(c_138,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_83,c_136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR048+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/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.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:21:51 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.65/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/1.82
% 3.65/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.83/1.85
% 3.83/1.85 Inference rules
% 3.83/1.85 ----------------------
% 3.83/1.85 #Ref : 0
% 3.83/1.85 #Sup : 8
% 3.83/1.85 #Fact : 0
% 3.83/1.85 #Define : 0
% 3.83/1.85 #Split : 0
% 3.83/1.85 #Chain : 0
% 3.83/1.85 #Close : 0
% 3.83/1.85
% 3.83/1.85 Ordering : KBO
% 3.83/1.85
% 3.83/1.85 Simplification rules
% 3.83/1.85 ----------------------
% 3.83/1.85 #Subsume : 8
% 3.83/1.85 #Demod : 1
% 3.83/1.85 #Tautology : 5
% 3.83/1.85 #SimpNegUnit : 2
% 3.83/1.85 #BackRed : 0
% 3.83/1.85
% 3.83/1.85 #Partial instantiations: 0
% 3.83/1.85 #Strategies tried : 1
% 3.83/1.85
% 3.83/1.85 Timing (in seconds)
% 3.83/1.85 ----------------------
% 3.83/1.85 Preprocessing : 0.55
% 3.83/1.85 Parsing : 0.29
% 3.83/1.85 CNF conversion : 0.05
% 3.83/1.85 Main loop : 0.25
% 3.83/1.85 Inferencing : 0.10
% 3.83/1.85 Reduction : 0.06
% 3.83/1.85 Demodulation : 0.04
% 3.83/1.85 BG Simplification : 0.03
% 3.83/1.85 Subsumption : 0.05
% 3.83/1.85 Abstraction : 0.01
% 3.83/1.85 MUC search : 0.00
% 3.83/1.85 Cooper : 0.00
% 3.83/1.85 Total : 0.84
% 3.83/1.85 Index Insertion : 0.00
% 3.83/1.85 Index Deletion : 0.00
% 3.83/1.85 Index Matching : 0.00
% 3.83/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------