TSTP Solution File: KRS136+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS136+1 : TPTP v8.1.2. Released v3.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 : n004.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:45:15 EDT 2023
% Result : Theorem 2.73s 1.64s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 16 unt; 8 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 66 ( 34 ~; 27 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ xsd_string > xsd_integer > cowlThing > cowlNothing > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_36,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
tff(f_56,negated_conjecture,
~ ( ! [X] :
( cowlThing(X)
& ~ cowlNothing(X) )
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
tff(f_42,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
tff(c_2,plain,
! [X_1] : cowlThing(X_1),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_4,plain,
! [X_1] : ~ cowlNothing(X_1),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_12,plain,
( ~ xsd_integer('#skF_3')
| xsd_integer('#skF_4')
| ~ cowlThing('#skF_2')
| cowlNothing('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_20,plain,
( ~ xsd_integer('#skF_3')
| xsd_integer('#skF_4')
| ~ cowlThing('#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_4,c_12]) ).
tff(c_28,plain,
( ~ xsd_integer('#skF_3')
| xsd_integer('#skF_4') ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_20]) ).
tff(c_37,plain,
~ xsd_integer('#skF_3'),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_32,plain,
! [X_5] :
( xsd_string(X_5)
| xsd_integer(X_5) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_14,plain,
( ~ xsd_string('#skF_3')
| xsd_string('#skF_4')
| ~ cowlThing('#skF_2')
| cowlNothing('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_19,plain,
( ~ xsd_string('#skF_3')
| xsd_string('#skF_4')
| ~ cowlThing('#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_4,c_14]) ).
tff(c_26,plain,
( ~ xsd_string('#skF_3')
| xsd_string('#skF_4') ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_19]) ).
tff(c_31,plain,
~ xsd_string('#skF_3'),
inference(splitLeft,[status(thm)],[c_26]) ).
tff(c_36,plain,
xsd_integer('#skF_3'),
inference(resolution,[status(thm)],[c_32,c_31]) ).
tff(c_38,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_36]) ).
tff(c_39,plain,
xsd_integer('#skF_4'),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_40,plain,
xsd_integer('#skF_3'),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_16,plain,
( ~ xsd_integer('#skF_3')
| xsd_string('#skF_4')
| ~ cowlThing('#skF_2')
| cowlNothing('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_17,plain,
( ~ xsd_integer('#skF_3')
| xsd_string('#skF_4')
| ~ cowlThing('#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_4,c_16]) ).
tff(c_22,plain,
( ~ xsd_integer('#skF_3')
| xsd_string('#skF_4') ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_17]) ).
tff(c_44,plain,
xsd_string('#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_22]) ).
tff(c_45,plain,
! [X_6] :
( ~ xsd_integer(X_6)
| ~ xsd_string(X_6) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_48,plain,
~ xsd_integer('#skF_4'),
inference(resolution,[status(thm)],[c_44,c_45]) ).
tff(c_55,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_39,c_48]) ).
tff(c_57,plain,
xsd_string('#skF_3'),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_10,plain,
( ~ xsd_string('#skF_3')
| xsd_integer('#skF_4')
| ~ cowlThing('#skF_2')
| cowlNothing('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_18,plain,
( ~ xsd_string('#skF_3')
| xsd_integer('#skF_4')
| ~ cowlThing('#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_4,c_10]) ).
tff(c_24,plain,
( ~ xsd_string('#skF_3')
| xsd_integer('#skF_4') ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_18]) ).
tff(c_60,plain,
xsd_integer('#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_57,c_24]) ).
tff(c_56,plain,
xsd_string('#skF_4'),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_63,plain,
! [X_8] :
( ~ xsd_integer(X_8)
| ~ xsd_string(X_8) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_72,plain,
~ xsd_integer('#skF_4'),
inference(resolution,[status(thm)],[c_56,c_63]) ).
tff(c_78,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_60,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS136+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/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 : n004.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.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 20:03:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.73/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.64
% 2.80/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.80/1.67
% 2.80/1.67 Inference rules
% 2.80/1.67 ----------------------
% 2.80/1.67 #Ref : 0
% 2.80/1.67 #Sup : 6
% 2.80/1.67 #Fact : 0
% 2.80/1.67 #Define : 0
% 2.80/1.67 #Split : 3
% 2.80/1.67 #Chain : 0
% 2.80/1.67 #Close : 0
% 2.80/1.67
% 2.80/1.67 Ordering : KBO
% 2.80/1.67
% 2.80/1.67 Simplification rules
% 2.80/1.67 ----------------------
% 2.80/1.67 #Subsume : 3
% 2.80/1.67 #Demod : 11
% 2.80/1.67 #Tautology : 2
% 2.80/1.67 #SimpNegUnit : 5
% 2.80/1.67 #BackRed : 0
% 2.80/1.67
% 2.80/1.67 #Partial instantiations: 0
% 2.80/1.67 #Strategies tried : 1
% 2.80/1.67
% 2.80/1.67 Timing (in seconds)
% 2.80/1.67 ----------------------
% 2.80/1.68 Preprocessing : 0.40
% 2.80/1.68 Parsing : 0.22
% 2.80/1.68 CNF conversion : 0.03
% 2.80/1.68 Main loop : 0.21
% 2.80/1.68 Inferencing : 0.09
% 2.80/1.68 Reduction : 0.04
% 2.80/1.68 Demodulation : 0.03
% 2.80/1.68 BG Simplification : 0.02
% 2.80/1.68 Subsumption : 0.04
% 2.80/1.68 Abstraction : 0.01
% 2.80/1.68 MUC search : 0.00
% 2.80/1.68 Cooper : 0.00
% 2.80/1.68 Total : 0.65
% 2.80/1.68 Index Insertion : 0.00
% 2.80/1.68 Index Deletion : 0.00
% 2.80/1.68 Index Matching : 0.00
% 2.80/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------