TSTP Solution File: DAT028_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT028_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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n028.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:00 EDT 2023
% Result : Theorem 2.86s 1.71s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 29 ( 12 unt; 10 typ; 0 def)
% Number of atoms : 31 ( 2 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 29 ( 13 atm; 0 fun; 7 num; 9 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 11 (; 10 !; 1 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > empty > #skF_1 > #skF_3 > #skF_2
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_4',type,
'#skF_4': $int ).
%Foreground operators:
tff(empty,type,
empty: collection ).
tff('#skF_1',type,
'#skF_1': collection ).
tff('#skF_3',type,
'#skF_3': $int > $int ).
tff('#skF_2',type,
'#skF_2': collection ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_98,negated_conjecture,
~ ! [U: collection,V: collection] :
( ( ! [Wa: $int] :
( in(Wa,V)
=> $greater(Wa,0) )
& ! [Xa: $int] :
( in(Xa,U)
=> ? [Ya: $int] :
( in(Ya,V)
& $greater(Xa,Ya) ) ) )
=> ! [Za: $int] :
( in(Za,U)
=> $greater(Za,1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_46,plain,
in('#skF_4','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_34,plain,
in('#skF_4','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_24,plain,
! [X_18a: $int] :
( $greater(X_18a,'#skF_3'(X_18a))
| ~ in(X_18a,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_54,plain,
! [X_30a: $int] :
( $less('#skF_3'(X_30a),X_30a)
| ~ in(X_30a,'#skF_1') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_24]) ).
tff(c_60,plain,
$less('#skF_3'('#skF_4'),'#skF_4'),
inference(resolution,[status(thm)],[c_34,c_54]) ).
tff(c_74,plain,
'#skF_3'('#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_60]) ).
tff(c_28,plain,
! [X_18a: $int] :
( in('#skF_3'(X_18a),'#skF_2')
| ~ in(X_18a,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_81,plain,
( in('#skE_1','#skF_2')
| ~ in('#skF_4','#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_74,c_28]) ).
tff(c_100,plain,
in('#skE_1','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_46,c_81]) ).
tff(c_21,plain,
! [W_17a: $int] :
( ~ in(W_17a,'#skF_2')
| $greater(W_17a,0) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_30,plain,
! [W_17a: $int] :
( ~ in(W_17a,'#skF_2')
| $less(0,W_17a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_21]) ).
tff(c_105,plain,
$less(0,'#skE_1'),
inference(resolution,[status(thm)],[c_100,c_30]) ).
tff(c_64,plain,
'#skF_3'('#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_60]) ).
tff(c_63,plain,
$less('#skF_3'('#skF_4'),'#skF_4'),
inference(resolution,[status(thm)],[c_34,c_54]) ).
tff(c_71,plain,
$less('#skE_1','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_63]) ).
tff(c_17,plain,
~ $greater('#skF_4',1),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_35,plain,
~ $less(1,'#skF_4'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_17]) ).
tff(c_106,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_105,c_71,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT028_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.35 % Computer : n028.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:28:54 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.86/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.86/1.71
% 2.86/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/1.73
% 3.16/1.73 Inference rules
% 3.16/1.73 ----------------------
% 3.16/1.73 #Ref : 0
% 3.16/1.73 #Sup : 5
% 3.16/1.73 #Fact : 0
% 3.16/1.73 #Define : 1
% 3.16/1.73 #Split : 0
% 3.16/1.73 #Chain : 0
% 3.16/1.73 #Close : 1
% 3.16/1.73
% 3.16/1.73 Ordering : LPO
% 3.16/1.73
% 3.16/1.73 Simplification rules
% 3.16/1.73 ----------------------
% 3.16/1.73 #Subsume : 1
% 3.16/1.73 #Demod : 3
% 3.16/1.73 #Tautology : 3
% 3.16/1.73 #SimpNegUnit : 0
% 3.16/1.73 #BackRed : 0
% 3.16/1.73
% 3.16/1.73 #Partial instantiations: 0
% 3.16/1.74 #Strategies tried : 1
% 3.16/1.74
% 3.16/1.74 Timing (in seconds)
% 3.16/1.74 ----------------------
% 3.16/1.74 Preprocessing : 0.50
% 3.16/1.74 Parsing : 0.26
% 3.16/1.74 CNF conversion : 0.03
% 3.16/1.74 Main loop : 0.19
% 3.16/1.74 Inferencing : 0.06
% 3.16/1.74 Reduction : 0.04
% 3.16/1.74 Demodulation : 0.03
% 3.16/1.74 BG Simplification : 0.03
% 3.16/1.74 Subsumption : 0.04
% 3.16/1.74 Abstraction : 0.01
% 3.16/1.74 MUC search : 0.00
% 3.16/1.74 Cooper : 0.03
% 3.16/1.74 Total : 0.73
% 3.16/1.74 Index Insertion : 0.00
% 3.16/1.74 Index Deletion : 0.00
% 3.16/1.74 Index Matching : 0.00
% 3.16/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------