TSTP Solution File: PUZ132+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ132+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/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 : n031.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:16 EDT 2023
% Result : Theorem 2.67s 1.76s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 31 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ has_crime > country > city > capital > beautiful > #nlpp > capital_city > washington > usa > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(capital_city,type,
capital_city: $i > $i ).
tff(country,type,
country: $i > $o ).
tff(city,type,
city: $i > $o ).
tff(usa,type,
usa: $i ).
tff(beautiful,type,
beautiful: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(has_crime,type,
has_crime: $i > $o ).
tff(washington,type,
washington: $i ).
tff(capital,type,
capital: $i > $o ).
tff(f_38,axiom,
capital(washington),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',washington_type) ).
tff(f_35,axiom,
! [A] :
( capital(A)
=> city(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',capital_city_type) ).
tff(f_47,axiom,
! [X] :
( city(X)
=> has_crime(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crime_axiom) ).
tff(f_56,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',washington_conjecture) ).
tff(f_39,axiom,
country(usa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',usa_type) ).
tff(f_48,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',usa_capital_axiom) ).
tff(f_52,axiom,
! [X] :
( country(X)
=> beautiful(capital_city(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
tff(c_10,plain,
capital(washington),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_6,plain,
! [A_1] :
( city(A_1)
| ~ capital(A_1) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_16,plain,
! [X_3] :
( has_crime(X_3)
| ~ city(X_3) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_22,plain,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_29,plain,
~ beautiful(washington),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_12,plain,
country(usa),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_18,plain,
capital_city(usa) = washington,
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_36,plain,
! [X_8] :
( beautiful(capital_city(X_8))
| ~ country(X_8) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_39,plain,
( beautiful(washington)
| ~ country(usa) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_36]) ).
tff(c_41,plain,
beautiful(washington),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_39]) ).
tff(c_43,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_29,c_41]) ).
tff(c_44,plain,
~ has_crime(washington),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_49,plain,
~ city(washington),
inference(resolution,[status(thm)],[c_16,c_44]) ).
tff(c_52,plain,
~ capital(washington),
inference(resolution,[status(thm)],[c_6,c_49]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/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.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:03:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.67/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.77
% 2.67/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.79
% 3.01/1.79 Inference rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Ref : 0
% 3.01/1.79 #Sup : 6
% 3.01/1.79 #Fact : 0
% 3.01/1.79 #Define : 0
% 3.01/1.79 #Split : 1
% 3.01/1.79 #Chain : 0
% 3.01/1.79 #Close : 0
% 3.01/1.79
% 3.01/1.79 Ordering : KBO
% 3.01/1.79
% 3.01/1.79 Simplification rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Subsume : 0
% 3.01/1.79 #Demod : 4
% 3.01/1.79 #Tautology : 3
% 3.01/1.79 #SimpNegUnit : 1
% 3.01/1.79 #BackRed : 0
% 3.01/1.79
% 3.01/1.79 #Partial instantiations: 0
% 3.01/1.79 #Strategies tried : 1
% 3.01/1.79
% 3.01/1.79 Timing (in seconds)
% 3.01/1.80 ----------------------
% 3.03/1.80 Preprocessing : 0.45
% 3.03/1.80 Parsing : 0.24
% 3.03/1.80 CNF conversion : 0.02
% 3.03/1.80 Main loop : 0.18
% 3.03/1.80 Inferencing : 0.08
% 3.03/1.80 Reduction : 0.04
% 3.03/1.80 Demodulation : 0.03
% 3.03/1.80 BG Simplification : 0.01
% 3.03/1.80 Subsumption : 0.03
% 3.03/1.80 Abstraction : 0.00
% 3.03/1.80 MUC search : 0.00
% 3.03/1.80 Cooper : 0.00
% 3.03/1.80 Total : 0.67
% 3.03/1.80 Index Insertion : 0.00
% 3.03/1.80 Index Deletion : 0.00
% 3.03/1.80 Index Matching : 0.00
% 3.03/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------