TSTP Solution File: MSC028_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MSC028_1 : TPTP v8.1.2. Released v6.4.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 : 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:49:52 EDT 2023
% Result : Theorem 2.45s 1.58s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 3 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 17 ( 7 ~; 4 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 50 ( 9 atm; 9 fun; 12 num; 20 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 20 (; 15 !; 5 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_43,negated_conjecture,
~ ? [La: $int] :
! [Ka: $int] :
( $greater(Ka,La)
=> ? [S1a: $int,S2a: $int] :
( $greatereq(S1a,0)
& $greatereq(S2a,0)
& ( Ka = $sum($product(S1a,3),$product(S2a,5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula) ).
tff(f_1479,plain,
! [S1a: $int,S2a: $int,La: $int] :
? [Ka: $int] :
( $greater(Ka,La)
& ! [S1a: $int,S2a: $int] :
( ~ $greatereq(S1a,0)
| ~ $greatereq(S2a,0)
| ( Ka != $sum($product(3,S1a),$product(5,S2a)) ) ) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(f_1482,plain,
! [S1a: $int,S2a: $int,La: $int,Ka: $int] :
( ! [S1a: $int,S2a: $int,La: $int] :
? [Ka: $int] :
( $greater(Ka,La)
& ! [S1a: $int,S2a: $int] :
( ~ $greatereq(S1a,0)
| ~ $greatereq(S2a,0)
| ( Ka != $sum($product(3,S1a),$product(5,S2a)) ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_1483,plain,
$false,
inference(equivalence,[status(thm)],[f_1479,f_1482]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_1483]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC028_1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:04:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.45/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.45/1.58
% 2.45/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.62
% 2.64/1.62 Inference rules
% 2.64/1.62 ----------------------
% 2.64/1.62 #Ref : 0
% 2.64/1.62 #Sup : 0
% 2.64/1.62 #Fact : 0
% 2.64/1.62 #Define : 0
% 2.64/1.62 #Split : 0
% 2.64/1.62 #Chain : 0
% 2.64/1.62 #Close : 0
% 2.64/1.62
% 2.64/1.62 Ordering : LPO
% 2.64/1.62
% 2.64/1.62 Simplification rules
% 2.64/1.62 ----------------------
% 2.64/1.62 #Subsume : 0
% 2.64/1.62 #Demod : 0
% 2.64/1.62 #Tautology : 0
% 2.64/1.62 #SimpNegUnit : 0
% 2.64/1.62 #BackRed : 0
% 2.64/1.62
% 2.64/1.62 #Partial instantiations: 0
% 2.64/1.62 #Strategies tried : 1
% 2.64/1.62
% 2.64/1.62 Timing (in seconds)
% 2.64/1.62 ----------------------
% 2.64/1.63 Preprocessing : 0.51
% 2.64/1.63 Parsing : 0.24
% 2.64/1.63 CNF conversion : 0.02
% 2.64/1.63 Main loop : 0.03
% 2.64/1.63 Inferencing : 0.00
% 2.64/1.63 Reduction : 0.00
% 2.64/1.63 Demodulation : 0.00
% 2.64/1.63 BG Simplification : 0.00
% 2.64/1.63 Subsumption : 0.02
% 2.64/1.63 Abstraction : 0.00
% 2.64/1.63 MUC search : 0.00
% 2.64/1.63 Cooper : 0.08
% 2.64/1.63 Total : 0.61
% 2.64/1.63 Index Insertion : 0.00
% 2.64/1.63 Index Deletion : 0.00
% 2.64/1.63 Index Matching : 0.00
% 2.64/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------