TSTP Solution File: KRS077+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS077+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 : n011.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.68s 1.94s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 7 unt; 15 typ; 0 def)
% Number of atoms : 53 ( 5 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 50 ( 21 ~; 18 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 14 >; 4 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 28 (; 26 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rs > rr > rinvS > xsd_string > xsd_integer > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_09372 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
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('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff(cp,type,
cp: $i > $o ).
tff(i2003_11_14_17_19_09372,type,
i2003_11_14_17_19_09372: $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_144,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_137,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ! [Y0,Y1] :
( ( rr(X,Y0)
& rr(X,Y1) )
=> ( Y0 = Y1 ) )
& ? [Y] :
( rr(X,Y)
& ! [Z] :
( rinvS(Y,Z)
=> cp(Z) ) )
& ~ cp(X)
& ? [Y] :
( rs(X,Y)
& cp(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_148,axiom,
! [X,Y] :
( rs(X,Y)
=> rr(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_142,axiom,
! [X,Y] :
( rinvS(X,Y)
<=> rs(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(c_62,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_87,plain,
! [X_69] :
( rs(X_69,'#skF_5'(X_69))
| ~ cUnsatisfiable(X_69) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_64,plain,
! [X_55,Y_56] :
( rr(X_55,Y_56)
| ~ rs(X_55,Y_56) ),
inference(cnfTransformation,[status(thm)],[f_148]) ).
tff(c_91,plain,
! [X_69] :
( rr(X_69,'#skF_5'(X_69))
| ~ cUnsatisfiable(X_69) ),
inference(resolution,[status(thm)],[c_87,c_64]) ).
tff(c_42,plain,
! [X_33] :
( rr(X_33,'#skF_4'(X_33))
| ~ cUnsatisfiable(X_33) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_105,plain,
! [Y1_78,Y0_79,X_80] :
( ( Y1_78 = Y0_79 )
| ~ rr(X_80,Y1_78)
| ~ rr(X_80,Y0_79)
| ~ cUnsatisfiable(X_80) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_115,plain,
! [Y0_81,X_82] :
( ( Y0_81 = '#skF_4'(X_82) )
| ~ rr(X_82,Y0_81)
| ~ cUnsatisfiable(X_82) ),
inference(resolution,[status(thm)],[c_42,c_105]) ).
tff(c_130,plain,
! [X_86] :
( ( '#skF_5'(X_86) = '#skF_4'(X_86) )
| ~ cUnsatisfiable(X_86) ),
inference(resolution,[status(thm)],[c_91,c_115]) ).
tff(c_134,plain,
'#skF_5'(i2003_11_14_17_19_09372) = '#skF_4'(i2003_11_14_17_19_09372),
inference(resolution,[status(thm)],[c_62,c_130]) ).
tff(c_36,plain,
! [X_33] :
( rs(X_33,'#skF_5'(X_33))
| ~ cUnsatisfiable(X_33) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_92,plain,
! [X_70,Y_71] :
( rinvS(X_70,Y_71)
| ~ rs(Y_71,X_70) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_99,plain,
! [X_33] :
( rinvS('#skF_5'(X_33),X_33)
| ~ cUnsatisfiable(X_33) ),
inference(resolution,[status(thm)],[c_36,c_92]) ).
tff(c_138,plain,
( rinvS('#skF_4'(i2003_11_14_17_19_09372),i2003_11_14_17_19_09372)
| ~ cUnsatisfiable(i2003_11_14_17_19_09372) ),
inference(superposition,[status(thm),theory(equality)],[c_134,c_99]) ).
tff(c_154,plain,
rinvS('#skF_4'(i2003_11_14_17_19_09372),i2003_11_14_17_19_09372),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_138]) ).
tff(c_40,plain,
! [Z_52,X_33] :
( cp(Z_52)
| ~ rinvS('#skF_4'(X_33),Z_52)
| ~ cUnsatisfiable(X_33) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_192,plain,
( cp(i2003_11_14_17_19_09372)
| ~ cUnsatisfiable(i2003_11_14_17_19_09372) ),
inference(resolution,[status(thm)],[c_154,c_40]) ).
tff(c_195,plain,
cp(i2003_11_14_17_19_09372),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_192]) ).
tff(c_38,plain,
! [X_33] :
( ~ cp(X_33)
| ~ cUnsatisfiable(X_33) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_198,plain,
~ cUnsatisfiable(i2003_11_14_17_19_09372),
inference(resolution,[status(thm)],[c_195,c_38]) ).
tff(c_202,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_62,c_198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS077+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/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.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:07:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.68/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.94
% 3.68/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.68/1.97
% 3.68/1.97 Inference rules
% 3.68/1.97 ----------------------
% 3.68/1.97 #Ref : 0
% 3.68/1.97 #Sup : 27
% 3.68/1.97 #Fact : 0
% 3.68/1.97 #Define : 0
% 3.68/1.97 #Split : 0
% 3.68/1.97 #Chain : 0
% 3.79/1.97 #Close : 0
% 3.79/1.97
% 3.79/1.97 Ordering : KBO
% 3.79/1.97
% 3.79/1.97 Simplification rules
% 3.79/1.97 ----------------------
% 3.79/1.97 #Subsume : 1
% 3.79/1.97 #Demod : 10
% 3.79/1.97 #Tautology : 19
% 3.79/1.97 #SimpNegUnit : 0
% 3.79/1.97 #BackRed : 0
% 3.79/1.97
% 3.79/1.97 #Partial instantiations: 0
% 3.79/1.97 #Strategies tried : 1
% 3.79/1.97
% 3.79/1.97 Timing (in seconds)
% 3.79/1.97 ----------------------
% 3.79/1.98 Preprocessing : 0.53
% 3.79/1.98 Parsing : 0.28
% 3.79/1.98 CNF conversion : 0.04
% 3.79/1.98 Main loop : 0.24
% 3.79/1.98 Inferencing : 0.10
% 3.79/1.98 Reduction : 0.06
% 3.79/1.98 Demodulation : 0.04
% 3.79/1.98 BG Simplification : 0.02
% 3.79/1.98 Subsumption : 0.05
% 3.79/1.98 Abstraction : 0.01
% 3.79/1.98 MUC search : 0.00
% 3.79/1.98 Cooper : 0.00
% 3.79/1.98 Total : 0.82
% 3.79/1.98 Index Insertion : 0.00
% 3.79/1.98 Index Deletion : 0.00
% 3.79/1.98 Index Matching : 0.00
% 3.79/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------