TSTP Solution File: CSR025+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR025+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 : n013.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:34 EDT 2023
% Result : Theorem 3.43s 1.79s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 24
% Syntax : Number of formulae : 27 ( 4 unt; 22 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 15 >; 6 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_16_130933 > tptpcol_15_130931 > thing > predicate > mtvisible > microtheory > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_transitivebinarypredicate > c_tptpcol_16_130933 > c_tptpcol_15_130931 > c_patterndetectormt > c_genlmt > 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(tptpcol_15_130931,type,
tptpcol_15_130931: $i > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(genlmt,type,
genlmt: ( $i * $i ) > $o ).
tff(c_genlmt,type,
c_genlmt: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(c_transitivebinarypredicate,type,
c_transitivebinarypredicate: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(c_tptpcol_15_130931,type,
c_tptpcol_15_130931: $i ).
tff(c_patterndetectormt,type,
c_patterndetectormt: $i ).
tff(c_tptpcol_16_130933,type,
c_tptpcol_16_130933: $i ).
tff(tptpcol_16_130933,type,
tptpcol_16_130933: $i > $o ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
tff(thing,type,
thing: $i > $o ).
tff(c_basekb,type,
c_basekb: $i ).
tff(c_universalvocabularymt,type,
c_universalvocabularymt: $i ).
tff(transitivebinarypredicate,type,
transitivebinarypredicate: $i > $o ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(f_275,negated_conjecture,
~ ( mtvisible(c_patterndetectormt)
=> genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query25) ).
tff(f_41,axiom,
genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just4) ).
tff(c_108,plain,
~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
inference(cnfTransformation,[status(thm)],[f_275]) ).
tff(c_8,plain,
genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_111,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR025+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.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:51:32 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.43/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.43/1.79
% 3.43/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.69/1.83
% 3.69/1.83 Inference rules
% 3.69/1.83 ----------------------
% 3.69/1.83 #Ref : 0
% 3.69/1.83 #Sup : 0
% 3.69/1.83 #Fact : 0
% 3.69/1.83 #Define : 0
% 3.69/1.83 #Split : 0
% 3.69/1.83 #Chain : 0
% 3.69/1.83 #Close : 0
% 3.69/1.83
% 3.69/1.83 Ordering : KBO
% 3.69/1.83
% 3.69/1.83 Simplification rules
% 3.69/1.83 ----------------------
% 3.69/1.83 #Subsume : 54
% 3.69/1.83 #Demod : 0
% 3.69/1.83 #Tautology : 0
% 3.69/1.83 #SimpNegUnit : 1
% 3.69/1.83 #BackRed : 0
% 3.69/1.83
% 3.69/1.83 #Partial instantiations: 0
% 3.69/1.83 #Strategies tried : 1
% 3.69/1.83
% 3.69/1.83 Timing (in seconds)
% 3.69/1.83 ----------------------
% 3.69/1.83 Preprocessing : 0.56
% 3.69/1.83 Parsing : 0.31
% 3.69/1.83 CNF conversion : 0.04
% 3.69/1.83 Main loop : 0.13
% 3.69/1.83 Inferencing : 0.00
% 3.69/1.83 Reduction : 0.06
% 3.69/1.83 Demodulation : 0.04
% 3.69/1.83 BG Simplification : 0.03
% 3.69/1.83 Subsumption : 0.05
% 3.69/1.83 Abstraction : 0.01
% 3.69/1.83 MUC search : 0.00
% 3.69/1.83 Cooper : 0.00
% 3.69/1.83 Total : 0.74
% 3.69/1.83 Index Insertion : 0.00
% 3.69/1.83 Index Deletion : 0.00
% 3.69/1.83 Index Matching : 0.00
% 3.69/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------