TSTP Solution File: SWV005-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV005-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 : n013.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.37s 1.85s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 22 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_than > #nlpp > successor > predecessor > a > one > n > l > k > i
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(l,type,
l: $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_110,axiom,
~ less_than(k,l),
file(unknown,unknown) ).
tff(f_108,axiom,
~ less_than(n,k),
file(unknown,unknown) ).
tff(f_115,axiom,
less_than(a(k),a(predecessor(l))),
file(unknown,unknown) ).
tff(f_114,axiom,
less_than(one,l),
file(unknown,unknown) ).
tff(f_133,axiom,
! [X] :
( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l)
| ~ less_than(a(X),a(predecessor(l))) ),
file(unknown,unknown) ).
tff(c_28,plain,
~ less_than(k,l),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_26,plain,
~ less_than(n,k),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_36,plain,
less_than(a(k),a(predecessor(l))),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_34,plain,
less_than(one,l),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_40,plain,
! [X_24] :
( ~ less_than(a(X_24),a(predecessor(l)))
| ~ less_than(one,l)
| less_than(n,X_24)
| less_than(X_24,l) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_326,plain,
! [X_50] :
( ~ less_than(a(X_50),a(predecessor(l)))
| less_than(n,X_50)
| less_than(X_50,l) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_40]) ).
tff(c_335,plain,
( less_than(n,k)
| less_than(k,l) ),
inference(resolution,[status(thm)],[c_36,c_326]) ).
tff(c_341,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_26,c_335]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.16/0.37 % Computer : n013.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 23:11:17 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.37/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.86
% 3.50/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.50/1.88
% 3.50/1.88 Inference rules
% 3.50/1.88 ----------------------
% 3.50/1.88 #Ref : 3
% 3.50/1.88 #Sup : 60
% 3.50/1.88 #Fact : 2
% 3.50/1.88 #Define : 0
% 3.50/1.88 #Split : 2
% 3.50/1.88 #Chain : 0
% 3.50/1.88 #Close : 0
% 3.50/1.88
% 3.50/1.88 Ordering : KBO
% 3.50/1.88
% 3.50/1.88 Simplification rules
% 3.50/1.88 ----------------------
% 3.50/1.88 #Subsume : 5
% 3.50/1.88 #Demod : 13
% 3.50/1.88 #Tautology : 27
% 3.50/1.88 #SimpNegUnit : 3
% 3.50/1.88 #BackRed : 0
% 3.50/1.88
% 3.50/1.88 #Partial instantiations: 0
% 3.50/1.88 #Strategies tried : 1
% 3.50/1.88
% 3.50/1.88 Timing (in seconds)
% 3.50/1.88 ----------------------
% 3.50/1.88 Preprocessing : 0.47
% 3.50/1.88 Parsing : 0.23
% 3.50/1.88 CNF conversion : 0.03
% 3.50/1.88 Main loop : 0.34
% 3.50/1.88 Inferencing : 0.12
% 3.50/1.88 Reduction : 0.09
% 3.50/1.88 Demodulation : 0.06
% 3.50/1.88 BG Simplification : 0.02
% 3.50/1.88 Subsumption : 0.07
% 3.50/1.88 Abstraction : 0.01
% 3.50/1.88 MUC search : 0.00
% 3.50/1.89 Cooper : 0.00
% 3.50/1.89 Total : 0.85
% 3.50/1.89 Index Insertion : 0.00
% 3.50/1.89 Index Deletion : 0.00
% 3.50/1.89 Index Matching : 0.00
% 3.50/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------