TSTP Solution File: CSR032+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR032+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:40 EDT 2023
% Result : Theorem 3.93s 1.93s
% Output : CNFRefutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 40
% Syntax : Number of formulae : 49 ( 6 unt; 35 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 4 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 20 >; 10 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 15 con; 0-2 aty)
% Number of variables : 9 (; 8 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ natargument > natfunction > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > trajector_underspecified > thing > predicate > mtvisible > microtheory > location_underspecified > individual > collection > city > binarypredicate > f_citynamedfn > #nlpp > s_agen > n_2 > n_1 > c_universalvocabularymt > c_transitivebinarypredicate > c_trajector_underspecified > c_thing > c_reasoningaboutpossibleantecedentsmt > c_location_underspecified > c_individual > c_humansociallifemt > c_genlmt > c_france > c_citynamedfn > 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(c_thing,type,
c_thing: $i ).
tff(collection,type,
collection: $i > $o ).
tff(c_reasoningaboutpossibleantecedentsmt,type,
c_reasoningaboutpossibleantecedentsmt: $i ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(city,type,
city: $i > $o ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(location_underspecified,type,
location_underspecified: $i > $o ).
tff(c_genlmt,type,
c_genlmt: $i ).
tff(individual,type,
individual: $i > $o ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(c_transitivebinarypredicate,type,
c_transitivebinarypredicate: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(c_humansociallifemt,type,
c_humansociallifemt: $i ).
tff(c_france,type,
c_france: $i ).
tff(n_2,type,
n_2: $i ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(thing,type,
thing: $i > $o ).
tff(c_individual,type,
c_individual: $i ).
tff(trajector_underspecified,type,
trajector_underspecified: $i > $o ).
tff(natfunction,type,
natfunction: ( $i * $i ) > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(c_citynamedfn,type,
c_citynamedfn: $i ).
tff(n_1,type,
n_1: $i ).
tff(c_trajector_underspecified,type,
c_trajector_underspecified: $i ).
tff(f_citynamedfn,type,
f_citynamedfn: ( $i * $i ) > $i ).
tff(natargument,type,
natargument: ( $i * $i * $i ) > $o ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(c_location_underspecified,type,
c_location_underspecified: $i ).
tff(s_agen,type,
s_agen: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(f_35,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).
tff(f_59,axiom,
! [OBJ] :
( individual(OBJ)
=> trajector_underspecified(OBJ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just10) ).
tff(f_41,axiom,
! [OBJ] :
( trajector_underspecified(OBJ)
=> location_underspecified(OBJ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just3) ).
tff(f_219,axiom,
! [X] :
( location_underspecified(X)
=> isa(X,c_location_underspecified) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just44) ).
tff(f_319,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query32) ).
tff(c_2,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_20,plain,
! [OBJ_3] :
( trajector_underspecified(OBJ_3)
| ~ individual(OBJ_3) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_142,plain,
! [OBJ_112] :
( location_underspecified(OBJ_112)
| ~ trajector_underspecified(OBJ_112) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_146,plain,
! [OBJ_3] :
( location_underspecified(OBJ_3)
| ~ individual(OBJ_3) ),
inference(resolution,[status(thm)],[c_20,c_142]) ).
tff(c_151,plain,
! [X_119] :
( isa(X_119,c_location_underspecified)
| ~ location_underspecified(X_119) ),
inference(cnfTransformation,[status(thm)],[f_219]) ).
tff(c_138,plain,
! [COL_108] : ~ isa(f_citynamedfn(s_agen,c_france),COL_108),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_160,plain,
~ location_underspecified(f_citynamedfn(s_agen,c_france)),
inference(resolution,[status(thm)],[c_151,c_138]) ).
tff(c_163,plain,
~ individual(f_citynamedfn(s_agen,c_france)),
inference(resolution,[status(thm)],[c_146,c_160]) ).
tff(c_167,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR032+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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:24:51 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.93/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.93/1.93
% 3.93/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.93/1.96
% 3.93/1.96 Inference rules
% 3.93/1.96 ----------------------
% 3.93/1.96 #Ref : 0
% 3.93/1.96 #Sup : 4
% 3.93/1.96 #Fact : 0
% 3.93/1.96 #Define : 0
% 3.93/1.96 #Split : 0
% 3.93/1.96 #Chain : 0
% 3.93/1.96 #Close : 0
% 3.93/1.96
% 3.93/1.96 Ordering : KBO
% 3.93/1.96
% 3.93/1.96 Simplification rules
% 3.93/1.96 ----------------------
% 3.93/1.96 #Subsume : 14
% 3.93/1.96 #Demod : 1
% 3.93/1.96 #Tautology : 1
% 3.93/1.96 #SimpNegUnit : 0
% 3.93/1.96 #BackRed : 0
% 3.93/1.96
% 3.93/1.96 #Partial instantiations: 0
% 3.93/1.96 #Strategies tried : 1
% 3.93/1.96
% 3.93/1.96 Timing (in seconds)
% 3.93/1.96 ----------------------
% 3.93/1.96 Preprocessing : 0.60
% 3.93/1.96 Parsing : 0.34
% 3.93/1.96 CNF conversion : 0.04
% 3.93/1.96 Main loop : 0.26
% 3.93/1.96 Inferencing : 0.09
% 3.93/1.96 Reduction : 0.08
% 3.93/1.96 Demodulation : 0.06
% 3.93/1.96 BG Simplification : 0.03
% 3.93/1.96 Subsumption : 0.06
% 3.93/1.96 Abstraction : 0.01
% 3.93/1.96 MUC search : 0.00
% 3.93/1.96 Cooper : 0.00
% 3.93/1.96 Total : 0.91
% 3.93/1.96 Index Insertion : 0.00
% 3.93/1.96 Index Deletion : 0.00
% 3.93/1.96 Index Matching : 0.00
% 3.93/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------