TSTP Solution File: KRS065+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS065+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 : n021.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:06 EDT 2023
% Result : Unsatisfiable 2.26s 1.55s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 2 ~; 0 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 3 (; 2 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rop > xsd_string > xsd_integer > cowlThing > cowlNothing > #nlpp > ib > ia > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(rop,type,
rop: ( $i * $i ) > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(ib,type,
ib: $i ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff(ia,type,
ia: $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_34,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
tff(f_50,axiom,
? [X] :
( rop(ib,X)
& cowlNothing(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(c_4,plain,
! [X_1] : ~ cowlNothing(X_1),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_14,plain,
cowlNothing('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_17,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS065+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.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 20:03:22 EDT 2023
% 0.19/0.34 % CPUTime :
% 2.26/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/1.55
% 2.44/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.53/1.59
% 2.53/1.59 Inference rules
% 2.53/1.59 ----------------------
% 2.53/1.59 #Ref : 0
% 2.53/1.59 #Sup : 0
% 2.53/1.59 #Fact : 0
% 2.53/1.59 #Define : 0
% 2.53/1.59 #Split : 0
% 2.53/1.59 #Chain : 0
% 2.53/1.59 #Close : 0
% 2.53/1.59
% 2.53/1.59 Ordering : KBO
% 2.53/1.59
% 2.53/1.59 Simplification rules
% 2.53/1.59 ----------------------
% 2.53/1.59 #Subsume : 7
% 2.53/1.59 #Demod : 0
% 2.53/1.59 #Tautology : 0
% 2.53/1.59 #SimpNegUnit : 2
% 2.53/1.59 #BackRed : 0
% 2.53/1.59
% 2.53/1.59 #Partial instantiations: 0
% 2.53/1.59 #Strategies tried : 1
% 2.53/1.59
% 2.53/1.59 Timing (in seconds)
% 2.53/1.59 ----------------------
% 2.53/1.59 Preprocessing : 0.42
% 2.53/1.59 Parsing : 0.25
% 2.53/1.59 CNF conversion : 0.02
% 2.53/1.59 Main loop : 0.05
% 2.53/1.59 Inferencing : 0.00
% 2.53/1.59 Reduction : 0.03
% 2.53/1.59 Demodulation : 0.02
% 2.53/1.59 BG Simplification : 0.01
% 2.53/1.59 Subsumption : 0.02
% 2.53/1.59 Abstraction : 0.00
% 2.53/1.59 MUC search : 0.00
% 2.53/1.59 Cooper : 0.00
% 2.53/1.59 Total : 0.53
% 2.53/1.59 Index Insertion : 0.00
% 2.53/1.59 Index Deletion : 0.00
% 2.53/1.59 Index Matching : 0.00
% 2.53/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------