TSTP Solution File: DAT022_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT022_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 : n004.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.17s 1.76s
% Output : CNFRefutation 3.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 28 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 38 ( 9 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 29 ( 11 ~; 11 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 40 ( 8 atm; 0 fun; 18 num; 14 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 : 9 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > empty > #skF_1 > #skF_2
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
tff('#skF_3',type,
'#skF_3': $int ).
%Foreground operators:
tff(empty,type,
empty: collection ).
tff('#skF_1',type,
'#skF_1': collection ).
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_93,negated_conjecture,
~ ! [U: collection,V: collection] :
( ( ! [Wa: $int] :
( in(Wa,V)
=> $greater(Wa,0) )
& ( U = add(2,remove(7,V)) ) )
=> ! [Xa: $int] :
( in(Xa,U)
=> $greater(Xa,0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_71,axiom,
! [Za: $int,X1: collection,X2a: $int] :
( ( in(Za,X1)
| ( Za = X2a ) )
<=> in(Za,add(X2a,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f_78,axiom,
! [X3a: $int,X4: collection,X5a: $int] :
( ( in(X3a,X4)
& ( X3a != X5a ) )
<=> in(X3a,remove(X5a,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax5) ).
tff(c_17,plain,
~ $greater('#skF_3',0),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_31,plain,
~ $less(0,'#skF_3'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_17]) ).
tff(c_30,plain,
in('#skF_3','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_26,plain,
add(2,remove(7,'#skF_2')) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_84,plain,
! [Z_35a: $int,X1_36: collection,X2_37a: $int] :
( in(Z_35a,X1_36)
| ~ in(Z_35a,add(X2_37a,X1_36))
| ( Z_35a = X2_37a ) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_100,plain,
! [Z_38a: $int] :
( in(Z_38a,remove(7,'#skF_2'))
| ~ in(Z_38a,'#skF_1')
| ( Z_38a = 2 ) ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_84]) ).
tff(c_32,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_129,plain,
! [Z_39a: $int] :
( in(Z_39a,'#skF_2')
| ~ in(Z_39a,'#skF_1')
| ( Z_39a = 2 ) ),
inference(resolution,[status(thm)],[c_100,c_32]) ).
tff(c_146,plain,
( in('#skF_3','#skF_2')
| ( '#skF_3' = 2 ) ),
inference(resolution,[status(thm)],[c_30,c_129]) ).
tff(c_149,plain,
'#skF_3' = 2,
inference(splitLeft,[status(thm)],[c_146]) ).
tff(c_152,plain,
~ $less(0,2),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_31]) ).
tff(c_156,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_152]) ).
tff(c_164,plain,
in('#skF_3','#skF_2'),
inference(splitRight,[status(thm)],[c_146]) ).
tff(c_23,plain,
! [W_14a: $int] :
( ~ in(W_14a,'#skF_2')
| $greater(W_14a,0) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_25,plain,
! [W_14a: $int] :
( ~ in(W_14a,'#skF_2')
| $less(0,W_14a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_23]) ).
tff(c_169,plain,
$less(0,'#skF_3'),
inference(resolution,[status(thm)],[c_164,c_25]) ).
tff(c_170,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_31,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT022_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.12 % 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.13/0.32 % Computer : n004.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Thu Aug 3 13:08:11 EDT 2023
% 0.13/0.33 % CPUTime :
% 3.17/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.76
% 3.17/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.31/1.79
% 3.31/1.79 Inference rules
% 3.31/1.79 ----------------------
% 3.31/1.79 #Ref : 0
% 3.31/1.79 #Sup : 19
% 3.31/1.79 #Fact : 0
% 3.31/1.79 #Define : 0
% 3.31/1.79 #Split : 1
% 3.31/1.79 #Chain : 0
% 3.31/1.79 #Close : 0
% 3.31/1.79
% 3.31/1.79 Ordering : LPO
% 3.31/1.79
% 3.31/1.79 Simplification rules
% 3.31/1.79 ----------------------
% 3.31/1.79 #Subsume : 1
% 3.31/1.79 #Demod : 4
% 3.31/1.79 #Tautology : 12
% 3.31/1.79 #SimpNegUnit : 1
% 3.31/1.79 #BackRed : 2
% 3.31/1.79
% 3.31/1.79 #Partial instantiations: 0
% 3.31/1.79 #Strategies tried : 1
% 3.31/1.79
% 3.31/1.79 Timing (in seconds)
% 3.31/1.79 ----------------------
% 3.31/1.79 Preprocessing : 0.53
% 3.31/1.79 Parsing : 0.27
% 3.31/1.79 CNF conversion : 0.03
% 3.31/1.79 Main loop : 0.24
% 3.31/1.79 Inferencing : 0.08
% 3.31/1.79 Reduction : 0.06
% 3.31/1.79 Demodulation : 0.04
% 3.31/1.79 BG Simplification : 0.03
% 3.31/1.79 Subsumption : 0.04
% 3.31/1.79 Abstraction : 0.01
% 3.31/1.79 MUC search : 0.00
% 3.31/1.79 Cooper : 0.01
% 3.31/1.79 Total : 0.81
% 3.31/1.79 Index Insertion : 0.00
% 3.31/1.79 Index Deletion : 0.00
% 3.31/1.79 Index Matching : 0.00
% 3.31/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------