TSTP Solution File: KRS001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS001-1 : TPTP v8.1.2. Released v2.0.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 : n018.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:44:59 EDT 2023
% Result : Unsatisfiable 2.96s 1.84s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 39 ( 6 unt; 12 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 35 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 11 >; 2 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > equalish > r2least > r1most > e > d > c > #nlpp > u3r2 > u3r1 > u1r2 > u1r1 > exist
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(d,type,
d: $i > $o ).
tff(u3r1,type,
u3r1: $i > $i ).
tff(u1r1,type,
u1r1: $i > $i ).
tff(r1most,type,
r1most: $i > $o ).
tff(u3r2,type,
u3r2: $i > $i ).
tff(c,type,
c: $i > $o ).
tff(e,type,
e: $i > $o ).
tff(exist,type,
exist: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(u1r2,type,
u1r2: $i > $i ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(r2least,type,
r2least: $i > $o ).
tff(f_22,axiom,
e(exist),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X1] :
( c(X1)
| ~ e(X1) ),
file(unknown,unknown) ).
tff(f_97,axiom,
! [X1] :
( d(X1)
| ~ e(X1) ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X1] :
( r1most(X1)
| ~ d(X1) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X1] :
( r2least(X1)
| ~ c(X1) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X1] :
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X1] :
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
file(unknown,unknown) ).
tff(f_79,axiom,
! [X3,X2,X1] :
( equalish(X3,X2)
| ~ r1most(X1)
| ~ r(X1,X3)
| ~ r(X1,X2) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X1] :
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file(unknown,unknown) ).
tff(c_2,plain,
e(exist),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_33,plain,
! [X1_20] :
( ~ e(X1_20)
| c(X1_20) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_37,plain,
c(exist),
inference(resolution,[status(thm)],[c_2,c_33]) ).
tff(c_45,plain,
! [X1_24] :
( ~ e(X1_24)
| d(X1_24) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_49,plain,
d(exist),
inference(resolution,[status(thm)],[c_2,c_45]) ).
tff(c_16,plain,
! [X1_9] :
( ~ d(X1_9)
| r1most(X1_9) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_4,plain,
! [X1_1] :
( ~ c(X1_1)
| r2least(X1_1) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_12,plain,
! [X1_5] :
( ~ r2least(X1_5)
| r(X1_5,u1r2(X1_5)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_10,plain,
! [X1_4] :
( ~ r2least(X1_4)
| r(X1_4,u1r1(X1_4)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_70,plain,
! [X1_33,X2_34,X3_35] :
( ~ r(X1_33,X2_34)
| ~ r(X1_33,X3_35)
| ~ r1most(X1_33)
| equalish(X3_35,X2_34) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_96,plain,
! [X1_39,X3_40] :
( ~ r(X1_39,X3_40)
| ~ r1most(X1_39)
| equalish(X3_40,u1r1(X1_39))
| ~ r2least(X1_39) ),
inference(resolution,[status(thm)],[c_10,c_70]) ).
tff(c_8,plain,
! [X1_3] :
( ~ equalish(u1r2(X1_3),u1r1(X1_3))
| ~ r2least(X1_3) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_102,plain,
! [X1_41] :
( ~ r(X1_41,u1r2(X1_41))
| ~ r1most(X1_41)
| ~ r2least(X1_41) ),
inference(resolution,[status(thm)],[c_96,c_8]) ).
tff(c_107,plain,
! [X1_42] :
( ~ r1most(X1_42)
| ~ r2least(X1_42) ),
inference(resolution,[status(thm)],[c_12,c_102]) ).
tff(c_112,plain,
! [X1_43] :
( ~ r1most(X1_43)
| ~ c(X1_43) ),
inference(resolution,[status(thm)],[c_4,c_107]) ).
tff(c_117,plain,
! [X1_44] :
( ~ c(X1_44)
| ~ d(X1_44) ),
inference(resolution,[status(thm)],[c_16,c_112]) ).
tff(c_120,plain,
~ c(exist),
inference(resolution,[status(thm)],[c_49,c_117]) ).
tff(c_124,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_37,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS001-1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:18:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.96/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/1.84
% 2.96/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.87
% 2.96/1.87 Inference rules
% 2.96/1.87 ----------------------
% 2.96/1.87 #Ref : 0
% 2.96/1.87 #Sup : 19
% 2.96/1.87 #Fact : 0
% 2.96/1.87 #Define : 0
% 2.96/1.87 #Split : 0
% 2.96/1.87 #Chain : 0
% 2.96/1.87 #Close : 0
% 2.96/1.87
% 2.96/1.87 Ordering : KBO
% 2.96/1.87
% 2.96/1.87 Simplification rules
% 2.96/1.87 ----------------------
% 2.96/1.87 #Subsume : 3
% 2.96/1.87 #Demod : 1
% 2.96/1.87 #Tautology : 8
% 2.96/1.87 #SimpNegUnit : 0
% 2.96/1.87 #BackRed : 0
% 2.96/1.87
% 2.96/1.87 #Partial instantiations: 0
% 2.96/1.87 #Strategies tried : 1
% 2.96/1.87
% 2.96/1.87 Timing (in seconds)
% 2.96/1.87 ----------------------
% 2.96/1.87 Preprocessing : 0.45
% 2.96/1.87 Parsing : 0.25
% 2.96/1.88 CNF conversion : 0.02
% 2.96/1.88 Main loop : 0.24
% 2.96/1.88 Inferencing : 0.11
% 2.96/1.88 Reduction : 0.05
% 2.96/1.88 Demodulation : 0.03
% 2.96/1.88 BG Simplification : 0.02
% 2.96/1.88 Subsumption : 0.05
% 2.96/1.88 Abstraction : 0.01
% 2.96/1.88 MUC search : 0.00
% 2.96/1.88 Cooper : 0.00
% 2.96/1.88 Total : 0.74
% 2.96/1.88 Index Insertion : 0.00
% 2.96/1.88 Index Deletion : 0.00
% 2.96/1.88 Index Matching : 0.00
% 2.96/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------