TSTP Solution File: SWV007-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV007-1 : TPTP v8.1.2. Released v1.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 : n015.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 11:02:38 EDT 2023
% Result : Unsatisfiable 3.71s 2.01s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 39 ( 16 unt; 9 typ; 0 def)
% Number of atoms : 52 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_than > #nlpp > successor > predecessor > a > one > n > m > k > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(m,type,
m: $i ).
tff(predecessor,type,
predecessor: $i > $i ).
tff(k,type,
k: $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff(a,type,
a: $i > $i ).
tff(one,type,
one: $i ).
tff(n,type,
n: $i ).
tff(successor,type,
successor: $i > $i ).
tff(f_114,axiom,
less_than(i,m),
file(unknown,unknown) ).
tff(f_88,axiom,
! [X,Y] :
( ~ less_than(X,Y)
| ~ less_than(Y,X) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X] : less_than(X,successor(X)),
file(unknown,unknown) ).
tff(f_119,axiom,
less_than(a(m),a(k)),
file(unknown,unknown) ).
tff(f_79,axiom,
! [X,Y] :
( less_than(X,Y)
| less_than(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_113,axiom,
~ less_than(n,m),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X,Z,Y] :
( less_than(X,Z)
| ~ less_than(X,Y)
| ~ less_than(Y,Z) ),
file(unknown,unknown) ).
tff(f_146,axiom,
! [X] :
( less_than(X,i)
| ~ less_than(X,successor(n))
| ~ less_than(a(X),a(k)) ),
file(unknown,unknown) ).
tff(c_34,plain,
less_than(i,m),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_106,plain,
! [Y_35,X_36] :
( ~ less_than(Y_35,X_36)
| ~ less_than(X_36,Y_35) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_120,plain,
~ less_than(m,i),
inference(resolution,[status(thm)],[c_34,c_106]) ).
tff(c_12,plain,
! [X_8] : less_than(X_8,successor(X_8)),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_40,plain,
less_than(a(m),a(k)),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_142,plain,
! [Y_37,X_38] :
( ( Y_37 = X_38 )
| less_than(Y_37,X_38)
| less_than(X_38,Y_37) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_32,plain,
~ less_than(n,m),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_190,plain,
( ( n = m )
| less_than(m,n) ),
inference(resolution,[status(thm)],[c_142,c_32]) ).
tff(c_252,plain,
less_than(m,n),
inference(splitLeft,[status(thm)],[c_190]) ).
tff(c_227,plain,
! [Y_41,Z_42,X_43] :
( ~ less_than(Y_41,Z_42)
| ~ less_than(X_43,Y_41)
| less_than(X_43,Z_42) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_367,plain,
! [X_53,X_54] :
( ~ less_than(X_53,X_54)
| less_than(X_53,successor(X_54)) ),
inference(resolution,[status(thm)],[c_12,c_227]) ).
tff(c_277,plain,
! [X_45] :
( ~ less_than(a(X_45),a(k))
| ~ less_than(X_45,successor(n))
| less_than(X_45,i) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_286,plain,
( ~ less_than(m,successor(n))
| less_than(m,i) ),
inference(resolution,[status(thm)],[c_40,c_277]) ).
tff(c_291,plain,
~ less_than(m,successor(n)),
inference(negUnitSimplification,[status(thm)],[c_120,c_286]) ).
tff(c_370,plain,
~ less_than(m,n),
inference(resolution,[status(thm)],[c_367,c_291]) ).
tff(c_386,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_252,c_370]) ).
tff(c_387,plain,
n = m,
inference(splitRight,[status(thm)],[c_190]) ).
tff(c_46,plain,
! [X_25] :
( ~ less_than(a(X_25),a(k))
| ~ less_than(X_25,successor(n))
| less_than(X_25,i) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_431,plain,
! [X_56] :
( ~ less_than(a(X_56),a(k))
| ~ less_than(X_56,successor(m))
| less_than(X_56,i) ),
inference(demodulation,[status(thm),theory(equality)],[c_387,c_46]) ).
tff(c_440,plain,
( ~ less_than(m,successor(m))
| less_than(m,i) ),
inference(resolution,[status(thm)],[c_40,c_431]) ).
tff(c_445,plain,
less_than(m,i),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_440]) ).
tff(c_447,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_120,c_445]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV007-1 : TPTP v8.1.2. Released v1.0.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.35 % Computer : n015.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 23:07:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.71/2.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.71/2.02
% 3.71/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.71/2.04
% 3.71/2.04 Inference rules
% 3.71/2.04 ----------------------
% 3.71/2.04 #Ref : 4
% 3.71/2.04 #Sup : 79
% 3.71/2.04 #Fact : 2
% 3.71/2.04 #Define : 0
% 3.71/2.04 #Split : 3
% 3.71/2.04 #Chain : 0
% 3.71/2.04 #Close : 0
% 3.71/2.04
% 3.71/2.04 Ordering : KBO
% 3.71/2.04
% 3.71/2.04 Simplification rules
% 3.71/2.04 ----------------------
% 3.71/2.04 #Subsume : 14
% 3.71/2.04 #Demod : 30
% 3.71/2.04 #Tautology : 36
% 3.71/2.04 #SimpNegUnit : 8
% 3.71/2.04 #BackRed : 4
% 3.71/2.04
% 3.71/2.04 #Partial instantiations: 0
% 3.71/2.04 #Strategies tried : 1
% 3.71/2.04
% 3.71/2.04 Timing (in seconds)
% 3.71/2.04 ----------------------
% 3.71/2.05 Preprocessing : 0.58
% 3.71/2.05 Parsing : 0.27
% 3.71/2.05 CNF conversion : 0.03
% 3.71/2.05 Main loop : 0.36
% 3.71/2.05 Inferencing : 0.13
% 3.71/2.05 Reduction : 0.10
% 3.71/2.05 Demodulation : 0.07
% 3.71/2.05 BG Simplification : 0.02
% 3.71/2.05 Subsumption : 0.08
% 3.71/2.05 Abstraction : 0.01
% 3.71/2.05 MUC search : 0.00
% 3.71/2.05 Cooper : 0.00
% 3.71/2.05 Total : 0.99
% 3.71/2.05 Index Insertion : 0.00
% 3.71/2.05 Index Deletion : 0.00
% 3.71/2.05 Index Matching : 0.00
% 3.71/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------