TSTP Solution File: CSR035+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR035+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 : n025.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:44 EDT 2023
% Result : Theorem 3.27s 1.72s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 30
% Syntax : Number of formulae : 35 ( 4 unt; 28 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 : 30 ( 18 >; 12 *; 0 +; 0 <<)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-3 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ natargument > prettystring > natfunction > isa > genls > genlpreds > genlinverse > disjointwith > affiliatedwith > thing > predicate > mtvisible > footballteam > controlcharacterfreestring > collection > binarypredicate > agent_generic > f_instancewithrelationtofn > #nlpp > s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege > n_3 > n_2 > n_1 > c_instancewithrelationtofn > c_footballteam > c_englishmt > c_beloitcollege > c_basekb > c_affiliatedwith
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(mtvisible,type,
mtvisible: $i > $o ).
tff(genls,type,
genls: ( $i * $i ) > $o ).
tff(footballteam,type,
footballteam: $i > $o ).
tff(genlpreds,type,
genlpreds: ( $i * $i ) > $o ).
tff(collection,type,
collection: $i > $o ).
tff(prettystring,type,
prettystring: ( $i * $i ) > $o ).
tff(binarypredicate,type,
binarypredicate: $i > $o ).
tff(f_instancewithrelationtofn,type,
f_instancewithrelationtofn: ( $i * $i * $i ) > $i ).
tff(c_affiliatedwith,type,
c_affiliatedwith: $i ).
tff(c_footballteam,type,
c_footballteam: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff(c_beloitcollege,type,
c_beloitcollege: $i ).
tff(predicate,type,
predicate: $i > $o ).
tff(affiliatedwith,type,
affiliatedwith: ( $i * $i ) > $o ).
tff(n_2,type,
n_2: $i ).
tff(disjointwith,type,
disjointwith: ( $i * $i ) > $o ).
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(natargument,type,
natargument: ( $i * $i * $i ) > $o ).
tff(s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege,type,
s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege: $i ).
tff(controlcharacterfreestring,type,
controlcharacterfreestring: $i > $o ).
tff(n_3,type,
n_3: $i ).
tff(c_englishmt,type,
c_englishmt: $i ).
tff(c_instancewithrelationtofn,type,
c_instancewithrelationtofn: $i ).
tff(genlinverse,type,
genlinverse: ( $i * $i ) > $o ).
tff(agent_generic,type,
agent_generic: $i > $o ).
tff(f_204,negated_conjecture,
~ ? [X] :
( mtvisible(c_englishmt)
=> prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query35) ).
tff(f_37,axiom,
( mtvisible(c_englishmt)
=> prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
tff(c_80,plain,
! [X_81] : ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X_81),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_78,plain,
mtvisible(c_englishmt),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_2,plain,
( prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege)
| ~ mtvisible(c_englishmt) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_82,plain,
prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege),
inference(demodulation,[status(thm),theory(equality)],[c_78,c_2]) ).
tff(c_83,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_80,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR035+1 : TPTP v8.1.2. Released v3.4.0.
% 0.13/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.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:08:35 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.27/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.27/1.73
% 3.27/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.29/1.76
% 3.29/1.76 Inference rules
% 3.29/1.76 ----------------------
% 3.29/1.76 #Ref : 0
% 3.29/1.76 #Sup : 0
% 3.29/1.76 #Fact : 0
% 3.29/1.76 #Define : 0
% 3.29/1.76 #Split : 0
% 3.29/1.76 #Chain : 0
% 3.29/1.76 #Close : 0
% 3.29/1.76
% 3.29/1.76 Ordering : KBO
% 3.29/1.76
% 3.29/1.76 Simplification rules
% 3.29/1.76 ----------------------
% 3.29/1.76 #Subsume : 39
% 3.29/1.76 #Demod : 1
% 3.29/1.76 #Tautology : 0
% 3.29/1.76 #SimpNegUnit : 1
% 3.29/1.76 #BackRed : 0
% 3.29/1.76
% 3.29/1.76 #Partial instantiations: 0
% 3.29/1.76 #Strategies tried : 1
% 3.29/1.76
% 3.29/1.76 Timing (in seconds)
% 3.29/1.76 ----------------------
% 3.29/1.76 Preprocessing : 0.53
% 3.29/1.77 Parsing : 0.30
% 3.29/1.77 CNF conversion : 0.03
% 3.29/1.77 Main loop : 0.12
% 3.29/1.77 Inferencing : 0.00
% 3.29/1.77 Reduction : 0.06
% 3.29/1.77 Demodulation : 0.04
% 3.29/1.77 BG Simplification : 0.02
% 3.29/1.77 Subsumption : 0.05
% 3.29/1.77 Abstraction : 0.01
% 3.29/1.77 MUC search : 0.00
% 3.29/1.77 Cooper : 0.00
% 3.29/1.77 Total : 0.70
% 3.29/1.77 Index Insertion : 0.00
% 3.29/1.77 Index Deletion : 0.00
% 3.29/1.77 Index Matching : 0.00
% 3.29/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------