TSTP Solution File: PUZ130+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.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 : n028.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:54:15 EDT 2023
% Result : Theorem 3.57s 1.91s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 29
% Syntax : Number of formulae : 57 ( 24 unt; 18 typ; 0 def)
% Number of atoms : 68 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 27 ~; 21 |; 2 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 11 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-1 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ owner > hates > chased > pet > human > dog > cat > #nlpp > owner_of > odie > jon > garfield > #skF_7 > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(owner,type,
owner: ( $i * $i ) > $o ).
tff(owner_of,type,
owner_of: $i > $i ).
tff(human,type,
human: $i > $o ).
tff(dog,type,
dog: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(chased,type,
chased: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(cat,type,
cat: $i > $o ).
tff(hates,type,
hates: ( $i * $i ) > $o ).
tff(odie,type,
odie: $i ).
tff(garfield,type,
garfield: $i ).
tff(pet,type,
pet: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(jon,type,
jon: $i ).
tff(f_93,negated_conjecture,
~ hates(jon,jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_conjecture) ).
tff(f_34,axiom,
dog(odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_type) ).
tff(f_91,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_chase_axiom) ).
tff(f_40,axiom,
! [A] :
( dog(A)
=> pet(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dog_pet_type) ).
tff(f_47,axiom,
human(jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_type) ).
tff(f_59,axiom,
owner(jon,odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_o_owner_axiom) ).
tff(f_90,axiom,
! [X,Y] :
( ( human(X)
& pet(Y) )
=> ( owner(X,Y)
<=> ( X = owner_of(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owner_def) ).
tff(f_31,axiom,
cat(garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',garfield_type) ).
tff(f_44,axiom,
! [A] :
( cat(A)
=> pet(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_pet_type) ).
tff(f_60,axiom,
owner(jon,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_g_owner_axiom) ).
tff(f_82,axiom,
! [X,Y] :
( ( cat(X)
& dog(Y) )
=> ( chased(Y,X)
=> hates(owner_of(X),owner_of(Y)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_chase_axiom) ).
tff(c_46,plain,
~ hates(jon,jon),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_8,plain,
dog(odie),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_44,plain,
chased(odie,garfield),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_12,plain,
! [A_1] :
( pet(A_1)
| ~ dog(A_1) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_18,plain,
human(jon),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_26,plain,
owner(jon,odie),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_57,plain,
! [Y_24,X_25] :
( ( owner_of(Y_24) = X_25 )
| ~ owner(X_25,Y_24)
| ~ pet(Y_24)
| ~ human(X_25) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_69,plain,
( ( owner_of(odie) = jon )
| ~ pet(odie)
| ~ human(jon) ),
inference(resolution,[status(thm)],[c_26,c_57]) ).
tff(c_78,plain,
( ( owner_of(odie) = jon )
| ~ pet(odie) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_69]) ).
tff(c_116,plain,
~ pet(odie),
inference(splitLeft,[status(thm)],[c_78]) ).
tff(c_119,plain,
~ dog(odie),
inference(resolution,[status(thm)],[c_12,c_116]) ).
tff(c_126,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_119]) ).
tff(c_127,plain,
owner_of(odie) = jon,
inference(splitRight,[status(thm)],[c_78]) ).
tff(c_4,plain,
cat(garfield),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_14,plain,
! [A_2] :
( pet(A_2)
| ~ cat(A_2) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_28,plain,
owner(jon,garfield),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_66,plain,
( ( owner_of(garfield) = jon )
| ~ pet(garfield)
| ~ human(jon) ),
inference(resolution,[status(thm)],[c_28,c_57]) ).
tff(c_75,plain,
( ( owner_of(garfield) = jon )
| ~ pet(garfield) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_66]) ).
tff(c_79,plain,
~ pet(garfield),
inference(splitLeft,[status(thm)],[c_75]) ).
tff(c_85,plain,
~ cat(garfield),
inference(resolution,[status(thm)],[c_14,c_79]) ).
tff(c_90,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_85]) ).
tff(c_91,plain,
owner_of(garfield) = jon,
inference(splitRight,[status(thm)],[c_75]) ).
tff(c_38,plain,
! [X_10,Y_11] :
( hates(owner_of(X_10),owner_of(Y_11))
| ~ chased(Y_11,X_10)
| ~ dog(Y_11)
| ~ cat(X_10) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_97,plain,
! [Y_11] :
( hates(jon,owner_of(Y_11))
| ~ chased(Y_11,garfield)
| ~ dog(Y_11)
| ~ cat(garfield) ),
inference(superposition,[status(thm),theory(equality)],[c_91,c_38]) ).
tff(c_160,plain,
! [Y_29] :
( hates(jon,owner_of(Y_29))
| ~ chased(Y_29,garfield)
| ~ dog(Y_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_97]) ).
tff(c_163,plain,
( hates(jon,jon)
| ~ chased(odie,garfield)
| ~ dog(odie) ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_160]) ).
tff(c_168,plain,
hates(jon,jon),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_44,c_163]) ).
tff(c_170,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14 % 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 : n028.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 17:51:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.57/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/1.92
% 3.57/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/1.95
% 3.72/1.95 Inference rules
% 3.72/1.95 ----------------------
% 3.72/1.95 #Ref : 0
% 3.72/1.95 #Sup : 24
% 3.72/1.95 #Fact : 0
% 3.72/1.95 #Define : 0
% 3.72/1.95 #Split : 2
% 3.72/1.95 #Chain : 0
% 3.72/1.95 #Close : 0
% 3.72/1.95
% 3.72/1.95 Ordering : KBO
% 3.72/1.95
% 3.72/1.95 Simplification rules
% 3.72/1.95 ----------------------
% 3.72/1.95 #Subsume : 0
% 3.72/1.95 #Demod : 20
% 3.72/1.95 #Tautology : 9
% 3.72/1.95 #SimpNegUnit : 1
% 3.72/1.95 #BackRed : 0
% 3.72/1.95
% 3.72/1.95 #Partial instantiations: 0
% 3.72/1.95 #Strategies tried : 1
% 3.72/1.95
% 3.72/1.95 Timing (in seconds)
% 3.72/1.95 ----------------------
% 3.72/1.95 Preprocessing : 0.48
% 3.72/1.95 Parsing : 0.26
% 3.72/1.95 CNF conversion : 0.03
% 3.72/1.95 Main loop : 0.27
% 3.72/1.95 Inferencing : 0.11
% 3.72/1.95 Reduction : 0.07
% 3.72/1.95 Demodulation : 0.05
% 3.72/1.95 BG Simplification : 0.02
% 3.72/1.95 Subsumption : 0.05
% 3.72/1.95 Abstraction : 0.01
% 3.72/1.95 MUC search : 0.00
% 3.72/1.95 Cooper : 0.00
% 3.72/1.95 Total : 0.80
% 3.72/1.95 Index Insertion : 0.00
% 3.72/1.95 Index Deletion : 0.00
% 3.72/1.95 Index Matching : 0.00
% 3.72/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------