TSTP Solution File: KRS074+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS074+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/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 : n029.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:07 EDT 2023
% Result : Unsatisfiable 3.83s 2.04s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 18
% Syntax : Number of formulae : 25 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 20 ( 9 ~; 5 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 15 >; 6 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 8 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rs > rinvS > rinvF1 > rinvF > rf1 > rf > xsd_string > xsd_integer > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_18_59896 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rf,type,
rf: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(rinvS,type,
rinvS: ( $i * $i ) > $o ).
tff(rs,type,
rs: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(rinvF,type,
rinvF: ( $i * $i ) > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(i2003_11_14_17_18_59896,type,
i2003_11_14_17_18_59896: $i ).
tff(rf1,type,
rf1: ( $i * $i ) > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cp,type,
cp: $i > $o ).
tff(rinvF1,type,
rinvF1: ( $i * $i ) > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_166,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rs(X,Y)
& cp(Y)
& ? [Z] :
( rinvS(Y,Z)
& cp(Z) ) )
& ! [Y] :
( rs(X,Y)
=> ~ cp(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_204,axiom,
cUnsatisfiable(i2003_11_14_17_18_59896),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
tff(c_52,plain,
! [X_51] :
( cp('#skF_2'(X_51))
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_54,plain,
! [X_51] :
( rs(X_51,'#skF_2'(X_51))
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_137,plain,
! [Y_110,X_111] :
( ~ cp(Y_110)
| ~ rs(X_111,Y_110)
| ~ cUnsatisfiable(X_111) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_146,plain,
! [X_112] :
( ~ cp('#skF_2'(X_112))
| ~ cUnsatisfiable(X_112) ),
inference(resolution,[status(thm)],[c_54,c_137]) ).
tff(c_150,plain,
! [X_51] : ~ cUnsatisfiable(X_51),
inference(resolution,[status(thm)],[c_52,c_146]) ).
tff(c_78,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_152,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_150,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS074+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/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.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 20:27:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.83/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.83/2.05
% 3.83/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.83/2.07
% 3.83/2.07 Inference rules
% 3.83/2.07 ----------------------
% 3.83/2.07 #Ref : 0
% 3.83/2.07 #Sup : 12
% 3.83/2.07 #Fact : 0
% 3.83/2.07 #Define : 0
% 3.83/2.07 #Split : 0
% 3.83/2.07 #Chain : 0
% 3.83/2.07 #Close : 0
% 3.83/2.07
% 3.83/2.07 Ordering : KBO
% 3.83/2.07
% 3.83/2.07 Simplification rules
% 3.83/2.07 ----------------------
% 3.83/2.07 #Subsume : 8
% 3.83/2.07 #Demod : 0
% 3.83/2.07 #Tautology : 22
% 3.83/2.07 #SimpNegUnit : 1
% 3.83/2.07 #BackRed : 1
% 3.83/2.07
% 3.83/2.07 #Partial instantiations: 0
% 3.83/2.07 #Strategies tried : 1
% 3.83/2.07
% 3.83/2.07 Timing (in seconds)
% 3.83/2.07 ----------------------
% 3.83/2.08 Preprocessing : 0.60
% 3.83/2.08 Parsing : 0.32
% 3.83/2.08 CNF conversion : 0.04
% 3.83/2.08 Main loop : 0.22
% 3.83/2.08 Inferencing : 0.09
% 3.83/2.08 Reduction : 0.05
% 3.83/2.08 Demodulation : 0.03
% 3.83/2.08 BG Simplification : 0.02
% 3.83/2.08 Subsumption : 0.05
% 3.83/2.08 Abstraction : 0.01
% 3.83/2.08 MUC search : 0.00
% 3.83/2.08 Cooper : 0.00
% 3.83/2.08 Total : 0.86
% 3.83/2.08 Index Insertion : 0.00
% 3.83/2.08 Index Deletion : 0.00
% 3.83/2.08 Index Matching : 0.00
% 3.83/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------