TSTP Solution File: CSR053+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR053+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 : n027.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:58 EDT 2023
% Result : Theorem 3.01s 1.70s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 23 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 12 >; 6 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ isa > geographicalsubregions > genls > genlpreds > genlinverse > disjointwith > thing > predicate > mtvisible > geographicalregion > collection > binarypredicate > #nlpp > c_tptpgeo_member1_mt > c_georegion_l4_x35_y7 > c_georegion_l3_x11_y2 > c_basekb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(geographicalregion,type,
geographicalregion: $i > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(geographicalsubregions,type,
geographicalsubregions: ( $i * $i ) > $o ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(c_georegion_l4_x35_y7,type,
c_georegion_l4_x35_y7: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(thing,type,
thing: $i > $o ).
tff(c_georegion_l3_x11_y2,type,
c_georegion_l3_x11_y2: $i ).
tff(c_basekb,type,
c_basekb: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(c_tptpgeo_member1_mt,type,
c_tptpgeo_member1_mt: $i ).
tff(f_177,negated_conjecture,
~ ( mtvisible(c_tptpgeo_member1_mt)
=> geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query53) ).
tff(f_37,axiom,
( mtvisible(c_tptpgeo_member1_mt)
=> geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
tff(c_60,plain,
~ geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_62,plain,
mtvisible(c_tptpgeo_member1_mt),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_2,plain,
( geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_64,plain,
geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_2]) ).
tff(c_65,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR053+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.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 21:31:39 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.01/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.19/1.71
% 3.19/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.19/1.74
% 3.19/1.74 Inference rules
% 3.19/1.74 ----------------------
% 3.19/1.74 #Ref : 0
% 3.19/1.74 #Sup : 0
% 3.19/1.74 #Fact : 0
% 3.19/1.74 #Define : 0
% 3.19/1.74 #Split : 0
% 3.19/1.74 #Chain : 0
% 3.19/1.74 #Close : 0
% 3.19/1.74
% 3.19/1.74 Ordering : KBO
% 3.19/1.74
% 3.19/1.74 Simplification rules
% 3.19/1.74 ----------------------
% 3.19/1.74 #Subsume : 30
% 3.19/1.74 #Demod : 1
% 3.19/1.74 #Tautology : 0
% 3.19/1.74 #SimpNegUnit : 1
% 3.19/1.74 #BackRed : 0
% 3.19/1.74
% 3.19/1.74 #Partial instantiations: 0
% 3.19/1.74 #Strategies tried : 1
% 3.19/1.74
% 3.19/1.74 Timing (in seconds)
% 3.19/1.74 ----------------------
% 3.19/1.74 Preprocessing : 0.51
% 3.19/1.74 Parsing : 0.29
% 3.19/1.74 CNF conversion : 0.03
% 3.19/1.74 Main loop : 0.10
% 3.19/1.74 Inferencing : 0.00
% 3.19/1.74 Reduction : 0.04
% 3.19/1.74 Demodulation : 0.03
% 3.19/1.75 BG Simplification : 0.02
% 3.19/1.75 Subsumption : 0.04
% 3.19/1.75 Abstraction : 0.01
% 3.19/1.75 MUC search : 0.00
% 3.19/1.75 Cooper : 0.00
% 3.19/1.75 Total : 0.67
% 3.19/1.75 Index Insertion : 0.00
% 3.19/1.75 Index Deletion : 0.00
% 3.19/1.75 Index Matching : 0.00
% 3.19/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------