TSTP Solution File: DAT025_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT025_1 : TPTP v8.1.2. Released v5.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 : n024.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:36:59 EDT 2023
% Result : Theorem 3.27s 1.77s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 29 ( 3 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 5 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 35 ( 7 atm; 0 fun; 16 num; 12 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > empty > #skF_1
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
tff('#skF_2',type,
'#skF_2': $int ).
%Foreground operators:
tff(empty,type,
empty: collection ).
tff('#skF_1',type,
'#skF_1': collection ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_96,negated_conjecture,
~ ! [U: collection] :
( ( ! [Va: $int] :
( in(Va,U)
=> $greatereq(Va,0) )
& ! [Wa: $int] :
( in(Wa,U)
<=> in(Wa,remove(0,remove(1,U))) ) )
=> ! [Xa: $int] :
( in(Xa,U)
=> $greatereq(Xa,2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_78,axiom,
! [X3a: $int,X4: collection,X5a: $int] :
( ( in(X3a,X4)
& ( X3a != X5a ) )
<=> in(X3a,remove(X5a,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax5) ).
tff(c_33,plain,
in('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_59,plain,
! [W_32a: $int] :
( in(W_32a,remove(0,remove(1,'#skF_1')))
| ~ in(W_32a,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_35,plain,
! [X3_9a: $int,X4_10: collection,X5_11a: $int] :
( in(X3_9a,X4_10)
| ~ in(X3_9a,remove(X5_11a,X4_10)) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_76,plain,
! [W_33a: $int] :
( in(W_33a,remove(1,'#skF_1'))
| ~ in(W_33a,'#skF_1') ),
inference(resolution,[status(thm)],[c_59,c_35]) ).
tff(c_36,plain,
! [X3_9a: $int,X4_10: collection] : ~ in(X3_9a,remove(X3_9a,X4_10)),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_87,plain,
~ in(1,'#skF_1'),
inference(resolution,[status(thm)],[c_76,c_36]) ).
tff(c_92,plain,
'#skF_2' != 1,
inference(resolution,[status(thm)],[c_33,c_87]) ).
tff(c_70,plain,
~ in(0,'#skF_1'),
inference(resolution,[status(thm)],[c_59,c_36]) ).
tff(c_75,plain,
'#skF_2' != 0,
inference(resolution,[status(thm)],[c_33,c_70]) ).
tff(c_25,plain,
! [V_15a: $int] :
( ~ in(V_15a,'#skF_1')
| $greatereq(V_15a,0) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_51,plain,
! [V_25a: $int] :
( ~ in(V_25a,'#skF_1')
| ~ $less(V_25a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_25]) ).
tff(c_56,plain,
~ $less('#skF_2',0),
inference(resolution,[status(thm)],[c_33,c_51]) ).
tff(c_17,plain,
~ $greatereq('#skF_2',2),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_34,plain,
$less('#skF_2',2),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_17]) ).
tff(c_93,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_92,c_75,c_56,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : DAT025_1 : TPTP v8.1.2. Released v5.0.0.
% 0.13/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.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 13:13:30 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.27/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.77
% 3.27/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.27/1.79
% 3.27/1.79 Inference rules
% 3.27/1.79 ----------------------
% 3.27/1.79 #Ref : 0
% 3.27/1.79 #Sup : 7
% 3.27/1.79 #Fact : 0
% 3.27/1.79 #Define : 0
% 3.27/1.79 #Split : 0
% 3.27/1.79 #Chain : 0
% 3.27/1.79 #Close : 1
% 3.27/1.79
% 3.27/1.79 Ordering : LPO
% 3.27/1.79
% 3.27/1.79 Simplification rules
% 3.27/1.79 ----------------------
% 3.27/1.79 #Subsume : 1
% 3.27/1.79 #Demod : 1
% 3.27/1.79 #Tautology : 2
% 3.27/1.79 #SimpNegUnit : 0
% 3.27/1.79 #BackRed : 0
% 3.27/1.79
% 3.27/1.79 #Partial instantiations: 0
% 3.27/1.79 #Strategies tried : 1
% 3.27/1.79
% 3.27/1.79 Timing (in seconds)
% 3.27/1.80 ----------------------
% 3.27/1.80 Preprocessing : 0.52
% 3.27/1.80 Parsing : 0.28
% 3.27/1.80 CNF conversion : 0.03
% 3.27/1.80 Main loop : 0.21
% 3.27/1.80 Inferencing : 0.06
% 3.27/1.80 Reduction : 0.04
% 3.27/1.80 Demodulation : 0.03
% 3.27/1.80 BG Simplification : 0.03
% 3.27/1.80 Subsumption : 0.04
% 3.27/1.80 Abstraction : 0.01
% 3.27/1.80 MUC search : 0.00
% 3.27/1.80 Cooper : 0.04
% 3.27/1.80 Total : 0.77
% 3.27/1.80 Index Insertion : 0.00
% 3.27/1.80 Index Deletion : 0.00
% 3.27/1.80 Index Matching : 0.00
% 3.27/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------