TSTP Solution File: CSR054+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR054+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 : n016.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:59 EDT 2023
% Result : Theorem 3.84s 1.88s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 33
% Syntax : Number of formulae : 38 ( 4 unt; 31 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 : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 20 >; 12 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ natargument > tptpofobject > natfunction > isa > genls > genlpreds > genlinverse > disjointwith > airporthasiatacode > tptpquantity > thing > stringoflengthfn3 > predicate > partiallytangible > mtvisible > collection > binarypredicate > airport_physical > f_instancewithrelationtofn > #nlpp > f_tptpquantityfn_21 > s_tlh > n_3 > n_2 > n_170 > n_1 > c_tptpquantityfn_21 > c_instancewithrelationtofn > c_currentworlddatacollectormt_nonhomocentric > c_basekb > c_airporthasiatacode > c_airport_physical
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(stringoflengthfn3,type,
stringoflengthfn3: $i > $o ).
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(airport_physical,type,
airport_physical: $i > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(f_tptpquantityfn_21,type,
f_tptpquantityfn_21: $i > $i ).
tff(collection,type,
collection: $i > $o ).
tff(tptpofobject,type,
tptpofobject: ( $i * $i ) > $o ).
tff(c_airporthasiatacode,type,
c_airporthasiatacode: $i ).
tff(s_tlh,type,
s_tlh: $i ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(f_instancewithrelationtofn,type,
f_instancewithrelationtofn: ( $i * $i * $i ) > $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(predicate,type,
predicate: $i > $o ).
tff(n_2,type,
n_2: $i ).
tff(c_currentworlddatacollectormt_nonhomocentric,type,
c_currentworlddatacollectormt_nonhomocentric: $i ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(airporthasiatacode,type,
airporthasiatacode: ( $i * $i ) > $o ).
tff(c_airport_physical,type,
c_airport_physical: $i ).
tff(thing,type,
thing: $i > $o ).
tff(natfunction,type,
natfunction: ( $i * $i ) > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(n_1,type,
n_1: $i ).
tff(c_tptpquantityfn_21,type,
c_tptpquantityfn_21: $i ).
tff(natargument,type,
natargument: ( $i * $i * $i ) > $o ).
tff(n_170,type,
n_170: $i ).
tff(n_3,type,
n_3: $i ).
tff(c_instancewithrelationtofn,type,
c_instancewithrelationtofn: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(partiallytangible,type,
partiallytangible: $i > $o ).
tff(tptpquantity,type,
tptpquantity: $i > $o ).
tff(f_204,negated_conjecture,
~ ? [X] :
( mtvisible(c_currentworlddatacollectormt_nonhomocentric)
=> tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query54) ).
tff(f_37,axiom,
( mtvisible(c_currentworlddatacollectormt_nonhomocentric)
=> tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),f_tptpquantityfn_21(n_170)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
tff(c_82,plain,
! [X_81] : ~ tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),X_81),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_80,plain,
mtvisible(c_currentworlddatacollectormt_nonhomocentric),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_2,plain,
( tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),f_tptpquantityfn_21(n_170))
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_84,plain,
tptpofobject(f_instancewithrelationtofn(c_airport_physical,c_airporthasiatacode,s_tlh),f_tptpquantityfn_21(n_170)),
inference(demodulation,[status(thm),theory(equality)],[c_80,c_2]) ).
tff(c_85,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_82,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR054+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:36:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.84/1.88 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.84/1.88
% 3.84/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.96/1.94
% 3.96/1.94 Inference rules
% 3.96/1.94 ----------------------
% 3.96/1.94 #Ref : 0
% 3.96/1.94 #Sup : 0
% 3.96/1.94 #Fact : 0
% 3.96/1.94 #Define : 0
% 3.96/1.94 #Split : 0
% 3.96/1.94 #Chain : 0
% 3.96/1.94 #Close : 0
% 3.96/1.94
% 3.96/1.94 Ordering : KBO
% 3.96/1.94
% 3.96/1.94 Simplification rules
% 3.96/1.94 ----------------------
% 3.96/1.94 #Subsume : 40
% 3.96/1.94 #Demod : 1
% 3.96/1.94 #Tautology : 0
% 3.96/1.94 #SimpNegUnit : 1
% 3.96/1.94 #BackRed : 0
% 3.96/1.94
% 3.96/1.94 #Partial instantiations: 0
% 3.96/1.94 #Strategies tried : 1
% 3.96/1.94
% 3.96/1.94 Timing (in seconds)
% 3.96/1.94 ----------------------
% 3.96/1.94 Preprocessing : 0.68
% 3.96/1.95 Parsing : 0.40
% 3.96/1.95 CNF conversion : 0.05
% 3.96/1.95 Main loop : 0.16
% 3.96/1.95 Inferencing : 0.00
% 3.96/1.95 Reduction : 0.08
% 3.96/1.95 Demodulation : 0.06
% 3.96/1.95 BG Simplification : 0.02
% 3.96/1.95 Subsumption : 0.06
% 3.96/1.95 Abstraction : 0.01
% 3.96/1.95 MUC search : 0.00
% 3.96/1.95 Cooper : 0.00
% 3.96/1.95 Total : 0.93
% 3.96/1.95 Index Insertion : 0.00
% 3.96/1.95 Index Deletion : 0.00
% 3.96/1.95 Index Matching : 0.00
% 3.96/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------