TSTP Solution File: KRS110+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS110+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 : 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:12 EDT 2023
% Result : Unsatisfiable 4.15s 1.88s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 26
% Syntax : Number of formulae : 39 ( 4 unt; 21 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 17 ~; 11 |; 4 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 20 >; 7 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 22 (; 18 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rs > rinvS > rinvF1 > rinvF > rf1 > rf > ra_Px1 > xsd_string > xsd_integer > cpxcomp > cp > cowlThing > cowlNothing > ca_Ax2 > cUnsatisfiable > #nlpp > i2003_11_14_17_21_12565 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rf,type,
rf: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $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(ca_Ax2,type,
ca_Ax2: $i > $o ).
tff(rinvF,type,
rinvF: ( $i * $i ) > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(cpxcomp,type,
cpxcomp: $i > $o ).
tff(ra_Px1,type,
ra_Px1: ( $i * $i ) > $o ).
tff(i2003_11_14_17_21_12565,type,
i2003_11_14_17_21_12565: $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_184,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rs(X,Y)
& ca_Ax2(Y) )
& ! [Y] :
( rs(X,Y)
=> cpxcomp(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_207,axiom,
! [X] :
( ca_Ax2(X)
<=> ( cp(X)
& ? [Y] :
( rinvS(X,Y)
& cp(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_197,axiom,
! [X] :
( cpxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(f_191,axiom,
! [X] :
( cp(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_245,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
tff(c_56,plain,
! [X_61] :
( ca_Ax2('#skF_2'(X_61))
| ~ cUnsatisfiable(X_61) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_78,plain,
! [X_76] :
( cp(X_76)
| ~ ca_Ax2(X_76) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_58,plain,
! [X_61] :
( rs(X_61,'#skF_2'(X_61))
| ~ cUnsatisfiable(X_61) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_183,plain,
! [Y_133,X_134] :
( cpxcomp(Y_133)
| ~ rs(X_134,Y_133)
| ~ cUnsatisfiable(X_134) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_192,plain,
! [X_135] :
( cpxcomp('#skF_2'(X_135))
| ~ cUnsatisfiable(X_135) ),
inference(resolution,[status(thm)],[c_58,c_183]) ).
tff(c_139,plain,
! [X_122] :
( ra_Px1(X_122,'#skF_4'(X_122))
| ~ cpxcomp(X_122) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_64,plain,
! [X_68,Y_71] :
( ~ ra_Px1(X_68,Y_71)
| ~ cp(X_68) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_147,plain,
! [X_122] :
( ~ cp(X_122)
| ~ cpxcomp(X_122) ),
inference(resolution,[status(thm)],[c_139,c_64]) ).
tff(c_197,plain,
! [X_136] :
( ~ cp('#skF_2'(X_136))
| ~ cUnsatisfiable(X_136) ),
inference(resolution,[status(thm)],[c_192,c_147]) ).
tff(c_202,plain,
! [X_137] :
( ~ cUnsatisfiable(X_137)
| ~ ca_Ax2('#skF_2'(X_137)) ),
inference(resolution,[status(thm)],[c_78,c_197]) ).
tff(c_206,plain,
! [X_61] : ~ cUnsatisfiable(X_61),
inference(resolution,[status(thm)],[c_56,c_202]) ).
tff(c_98,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_209,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_206,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS110+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.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 20:03:36 EDT 2023
% 0.14/0.34 % CPUTime :
% 4.15/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.15/1.88
% 4.15/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.23/1.91
% 4.23/1.91 Inference rules
% 4.23/1.91 ----------------------
% 4.23/1.91 #Ref : 0
% 4.23/1.91 #Sup : 19
% 4.23/1.91 #Fact : 0
% 4.23/1.91 #Define : 0
% 4.23/1.91 #Split : 0
% 4.23/1.91 #Chain : 0
% 4.23/1.91 #Close : 0
% 4.23/1.91
% 4.23/1.91 Ordering : KBO
% 4.23/1.91
% 4.23/1.91 Simplification rules
% 4.23/1.91 ----------------------
% 4.23/1.91 #Subsume : 7
% 4.23/1.91 #Demod : 0
% 4.23/1.91 #Tautology : 29
% 4.23/1.91 #SimpNegUnit : 1
% 4.23/1.91 #BackRed : 1
% 4.23/1.91
% 4.23/1.91 #Partial instantiations: 0
% 4.23/1.91 #Strategies tried : 1
% 4.23/1.91
% 4.23/1.91 Timing (in seconds)
% 4.23/1.91 ----------------------
% 4.23/1.91 Preprocessing : 0.57
% 4.23/1.91 Parsing : 0.31
% 4.23/1.91 CNF conversion : 0.04
% 4.23/1.91 Main loop : 0.27
% 4.23/1.91 Inferencing : 0.11
% 4.23/1.91 Reduction : 0.06
% 4.23/1.91 Demodulation : 0.04
% 4.23/1.91 BG Simplification : 0.03
% 4.23/1.91 Subsumption : 0.06
% 4.23/1.91 Abstraction : 0.01
% 4.23/1.92 MUC search : 0.00
% 4.23/1.92 Cooper : 0.00
% 4.23/1.92 Total : 0.90
% 4.23/1.92 Index Insertion : 0.00
% 4.23/1.92 Index Deletion : 0.00
% 4.23/1.92 Index Matching : 0.00
% 4.23/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------