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 v5.5.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 : n018.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 2.85s 1.99s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 33 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 25 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 8 ( 6 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 11 (; 10 !; 1 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
%$ hates > chased > #nlpp > owner_of > dog_to_animal > cat_to_animal > odie > jon > garfield > #skF_1
%Foreground sorts:
tff(human,type,
human: $tType ).
tff(dog,type,
dog: $tType ).
tff(cat,type,
cat: $tType ).
tff(animal,type,
animal: $tType ).
%Background operators:
%Foreground operators:
tff(chased,type,
chased: ( dog * cat ) > $o ).
tff(owner_of,type,
owner_of: animal > human ).
tff(garfield,type,
garfield: cat ).
tff(jon,type,
jon: human ).
tff(hates,type,
hates: ( human * human ) > $o ).
tff(odie,type,
odie: dog ).
tff(cat_to_animal,type,
cat_to_animal: cat > animal ).
tff('#skF_1',type,
'#skF_1': animal > human ).
tff(dog_to_animal,type,
dog_to_animal: dog > animal ).
tff(f_48,negated_conjecture,
~ hates(jon,jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_hates_jon) ).
tff(f_46,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_chased_garfield) ).
tff(f_35,axiom,
jon = owner_of(dog_to_animal(odie)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_owns_odie) ).
tff(f_33,axiom,
! [A: animal] :
? [H: human] : ( H = owner_of(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',human_owner) ).
tff(f_34,axiom,
jon = owner_of(cat_to_animal(garfield)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_owns_garfield) ).
tff(f_45,axiom,
! [C: cat,D: dog] :
( chased(D,C)
=> hates(owner_of(cat_to_animal(C)),owner_of(dog_to_animal(D))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dog_chase_cat) ).
tff(c_14,plain,
~ hates(jon,jon),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_12,plain,
chased(odie,garfield),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_6,plain,
owner_of(dog_to_animal(odie)) = jon,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_21,plain,
! [A_6: animal] : ( owner_of(A_6) = '#skF_1'(A_6) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_33,plain,
'#skF_1'(dog_to_animal(odie)) = jon,
inference(superposition,[status(thm),theory(equality)],[c_6,c_21]) ).
tff(c_4,plain,
owner_of(cat_to_animal(garfield)) = jon,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [A_1: animal] : ( owner_of(A_1) = '#skF_1'(A_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_39,plain,
'#skF_1'(cat_to_animal(garfield)) = jon,
inference(superposition,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_10,plain,
! [C_4: cat,D_5: dog] :
( hates(owner_of(cat_to_animal(C_4)),owner_of(dog_to_animal(D_5)))
| ~ chased(D_5,C_4) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_65,plain,
! [C_8: cat,D_9: dog] :
( hates('#skF_1'(cat_to_animal(C_8)),'#skF_1'(dog_to_animal(D_9)))
| ~ chased(D_9,C_8) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_10]) ).
tff(c_72,plain,
! [D_10: dog] :
( hates(jon,'#skF_1'(dog_to_animal(D_10)))
| ~ chased(D_10,garfield) ),
inference(superposition,[status(thm),theory(equality)],[c_39,c_65]) ).
tff(c_75,plain,
( hates(jon,jon)
| ~ chased(odie,garfield) ),
inference(superposition,[status(thm),theory(equality)],[c_33,c_72]) ).
tff(c_77,plain,
hates(jon,jon),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_75]) ).
tff(c_79,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ130_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.12 % 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.10/0.32 % Computer : n018.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu Aug 3 17:46:20 EDT 2023
% 0.10/0.32 % CPUTime :
% 2.85/1.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.85/1.99
% 2.85/1.99 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.85/2.03
% 2.85/2.03 Inference rules
% 2.85/2.03 ----------------------
% 2.85/2.03 #Ref : 0
% 2.85/2.03 #Sup : 19
% 2.85/2.03 #Fact : 0
% 2.85/2.03 #Define : 0
% 2.85/2.03 #Split : 0
% 2.85/2.03 #Chain : 0
% 2.85/2.03 #Close : 0
% 2.85/2.03
% 2.85/2.03 Ordering : KBO
% 2.85/2.03
% 2.85/2.03 Simplification rules
% 2.85/2.03 ----------------------
% 2.85/2.03 #Subsume : 0
% 2.85/2.03 #Demod : 6
% 2.85/2.03 #Tautology : 14
% 2.85/2.03 #SimpNegUnit : 1
% 2.85/2.03 #BackRed : 0
% 2.85/2.03
% 2.85/2.03 #Partial instantiations: 0
% 2.85/2.03 #Strategies tried : 1
% 2.85/2.03
% 2.85/2.03 Timing (in seconds)
% 2.85/2.03 ----------------------
% 2.85/2.04 Preprocessing : 0.64
% 2.85/2.04 Parsing : 0.37
% 2.85/2.04 CNF conversion : 0.03
% 2.85/2.04 Main loop : 0.21
% 2.85/2.04 Inferencing : 0.08
% 2.85/2.04 Reduction : 0.06
% 2.85/2.04 Demodulation : 0.04
% 2.85/2.04 BG Simplification : 0.01
% 2.85/2.04 Subsumption : 0.04
% 2.85/2.04 Abstraction : 0.01
% 2.85/2.04 MUC search : 0.00
% 2.85/2.04 Cooper : 0.00
% 2.85/2.04 Total : 0.92
% 2.85/2.04 Index Insertion : 0.00
% 2.85/2.04 Index Deletion : 0.00
% 2.85/2.04 Index Matching : 0.00
% 2.85/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------