TSTP Solution File: DAT063_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT063_1 : TPTP v8.1.2. Released v5.5.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 : n017.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:37:05 EDT 2023
% Result : Theorem 2.85s 1.66s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of formulae : 13 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 1 ( 1 atm; 0 fun; 0 num; 0 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 3 (; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > app > #nlpp > toop > length > get > empty > #skF_1
%Foreground sorts:
tff(heap,type,
heap: $tType ).
%Background operators:
%Foreground operators:
tff(toop,type,
toop: heap > $int ).
tff(lsls,type,
lsls: ( heap * heap ) > $o ).
tff('#skF_1',type,
'#skF_1': heap ).
tff(empty,type,
empty: heap ).
tff(get,type,
get: heap > heap ).
tff(app,type,
app: ( heap * $int ) > heap ).
tff(length,type,
length: heap > $int ).
tff(f_87,axiom,
! [H: heap] : ~ lsls(H,empty),
file('/export/starexec/sandbox/benchmark/Axioms/DAT005_0.ax',ax_26) ).
tff(f_100,negated_conjecture,
~ ! [H: heap] :
( lsls(H,empty)
=> $less(length(H),length(empty)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_1b) ).
tff(c_24,plain,
! [H_18: heap] : ~ lsls(H_18,empty),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_34,plain,
lsls('#skF_1',empty),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_47,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_24,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : DAT063_1 : TPTP v8.1.2. Released v5.5.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 : n017.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 12:39:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.85/1.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.85/1.67
% 2.85/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.85/1.69
% 2.85/1.69 Inference rules
% 2.85/1.69 ----------------------
% 2.85/1.69 #Ref : 0
% 2.85/1.69 #Sup : 0
% 2.85/1.69 #Fact : 0
% 2.85/1.69 #Define : 0
% 2.85/1.69 #Split : 0
% 2.85/1.69 #Chain : 0
% 2.85/1.69 #Close : 0
% 2.85/1.69
% 2.85/1.69 Ordering : LPO
% 2.85/1.69
% 2.85/1.69 Simplification rules
% 2.85/1.69 ----------------------
% 2.85/1.69 #Subsume : 15
% 2.85/1.69 #Demod : 0
% 2.85/1.69 #Tautology : 1
% 2.85/1.69 #SimpNegUnit : 1
% 2.85/1.69 #BackRed : 0
% 2.85/1.69
% 2.85/1.69 #Partial instantiations: 0
% 2.85/1.69 #Strategies tried : 1
% 2.85/1.69
% 2.85/1.69 Timing (in seconds)
% 2.85/1.69 ----------------------
% 2.85/1.69 Preprocessing : 0.58
% 2.85/1.69 Parsing : 0.31
% 2.85/1.69 CNF conversion : 0.03
% 2.85/1.69 Main loop : 0.05
% 2.85/1.69 Inferencing : 0.00
% 2.85/1.69 Reduction : 0.02
% 2.85/1.69 Demodulation : 0.02
% 2.85/1.69 BG Simplification : 0.03
% 2.85/1.69 Subsumption : 0.02
% 2.85/1.69 Abstraction : 0.01
% 2.85/1.69 MUC search : 0.00
% 2.85/1.69 Cooper : 0.00
% 2.85/1.69 Total : 0.67
% 2.85/1.69 Index Insertion : 0.00
% 2.85/1.69 Index Deletion : 0.00
% 2.85/1.69 Index Matching : 0.00
% 2.85/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------