TSTP Solution File: DAT024_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT024_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 : n020.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 2.94s 1.72s
% Output : CNFRefutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 20 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 19 ( 12 ~; 2 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 24 ( 7 atm; 0 fun; 13 num; 4 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 : 5 (; 5 !; 0 ?; 5 :)
% 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) )
& ~ in(0,U)
& ~ in(1,U) )
=> ! [Wa: $int] :
( in(Wa,U)
=> $greatereq(Wa,2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_33,plain,
in('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_25,plain,
! [V_14a: $int] :
( ~ in(V_14a,'#skF_1')
| $greatereq(V_14a,0) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_61,plain,
! [V_23a: $int] :
( ~ in(V_23a,'#skF_1')
| ~ $less(V_23a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_25]) ).
tff(c_66,plain,
~ $less('#skF_2',0),
inference(resolution,[status(thm)],[c_33,c_61]) ).
tff(c_48,plain,
in('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_29,plain,
~ in(1,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_56,plain,
'#skF_2' != 1,
inference(resolution,[status(thm)],[c_48,c_29]) ).
tff(c_28,plain,
~ in(0,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_58,plain,
'#skF_2' != 0,
inference(resolution,[status(thm)],[c_48,c_28]) ).
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_67,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_66,c_56,c_58,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : DAT024_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/0.15 % 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.14/0.36 % Computer : n020.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 13:13:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.94/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.94/1.72
% 2.94/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/1.75
% 3.11/1.75 Inference rules
% 3.11/1.75 ----------------------
% 3.11/1.75 #Ref : 0
% 3.11/1.75 #Sup : 3
% 3.11/1.75 #Fact : 0
% 3.11/1.75 #Define : 0
% 3.11/1.75 #Split : 0
% 3.11/1.75 #Chain : 0
% 3.11/1.75 #Close : 1
% 3.11/1.75
% 3.11/1.75 Ordering : LPO
% 3.11/1.75
% 3.11/1.75 Simplification rules
% 3.11/1.75 ----------------------
% 3.11/1.75 #Subsume : 1
% 3.11/1.75 #Demod : 1
% 3.11/1.75 #Tautology : 1
% 3.11/1.75 #SimpNegUnit : 0
% 3.11/1.75 #BackRed : 0
% 3.11/1.75
% 3.11/1.76 #Partial instantiations: 0
% 3.11/1.76 #Strategies tried : 1
% 3.11/1.76
% 3.11/1.76 Timing (in seconds)
% 3.11/1.76 ----------------------
% 3.11/1.76 Preprocessing : 0.53
% 3.11/1.76 Parsing : 0.28
% 3.11/1.76 CNF conversion : 0.03
% 3.11/1.76 Main loop : 0.17
% 3.11/1.76 Inferencing : 0.04
% 3.11/1.76 Reduction : 0.03
% 3.11/1.76 Demodulation : 0.03
% 3.11/1.76 BG Simplification : 0.03
% 3.11/1.76 Subsumption : 0.04
% 3.11/1.76 Abstraction : 0.01
% 3.11/1.76 MUC search : 0.00
% 3.11/1.76 Cooper : 0.03
% 3.11/1.76 Total : 0.75
% 3.11/1.76 Index Insertion : 0.00
% 3.11/1.76 Index Deletion : 0.00
% 3.11/1.76 Index Matching : 0.00
% 3.11/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------