TSTP Solution File: ARI610_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI610_1 : TPTP v8.1.2. Released v5.1.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 : n019.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:34:06 EDT 2023
% Result : Theorem 3.32s 1.93s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 37 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 6 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 65 ( 27 atm; 20 fun; 10 num; 8 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_4',type,
'#skE_4': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_36,negated_conjecture,
~ ( ( ! [Xa: $int,Ya: $int] :
( $lesseq(Xa,Ya)
=> $lesseq(f(Xa),f(Ya)) )
& $less(f(b),f(a)) )
=> $lesseq(f(0),f($sum(a,$uminus(b)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_mon_implies_f_a_b_2) ).
tff(c_2,plain,
~ $lesseq(f(0),f($sum($uminus(b),a))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_14,plain,
$less(f($sum(a,$uminus(b))),f(0)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_17,plain,
$less(f($sum($uminus(b),a)),f(0)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_14]) ).
tff(c_105,plain,
f(0) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_104,plain,
f($sum($uminus(b),a)) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_21,plain,
$less(f($sum($uminus(b),a)),f(0)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_14]) ).
tff(c_114,plain,
$less('#skE_3','#skE_4'),
inference(demodulation,[status(thm),theory(equality)],[c_105,c_104,c_21]) ).
tff(c_109,plain,
f($sum($uminus(b),a)) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_112,plain,
f($sum(a,$uminus(b))) = '#skE_3',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_109]) ).
tff(c_113,plain,
f(0) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_6,plain,
! [X_1a: $int,Y_2a: $int] :
( $lesseq(f(X_1a),f(Y_2a))
| ~ $lesseq(X_1a,Y_2a) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_8,plain,
! [Y_2a: $int,X_1a: $int] :
( ~ $less(f(Y_2a),f(X_1a))
| $less(Y_2a,X_1a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_286,plain,
! [Y_40a: $int] :
( ~ $less(f(Y_40a),'#skE_4')
| $less(Y_40a,0) ),
inference(superposition,[status(thm),theory(equality)],[c_113,c_8]) ).
tff(c_289,plain,
( ~ $less('#skE_3','#skE_4')
| $less($sum(a,$uminus(b)),0) ),
inference(superposition,[status(thm),theory(equality)],[c_112,c_286]) ).
tff(c_301,plain,
$less($sum(a,$uminus(b)),0),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_289]) ).
tff(c_303,plain,
$less(a,b),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_301]) ).
tff(c_12,plain,
$less(f(b),f(a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_24,plain,
f(a) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_23,plain,
f(b) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_19,plain,
$less(f(b),f(a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_35,plain,
$less('#skE_1','#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_23,c_19]) ).
tff(c_31,plain,
f(b) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_67,plain,
f(a) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_226,plain,
! [Y_36a: $int] :
( ~ $less(f(Y_36a),'#skE_2')
| $less(Y_36a,a) ),
inference(superposition,[status(thm),theory(equality)],[c_67,c_8]) ).
tff(c_238,plain,
( ~ $less('#skE_1','#skE_2')
| $less(b,a) ),
inference(superposition,[status(thm),theory(equality)],[c_31,c_226]) ).
tff(c_250,plain,
$less(b,a),
inference(demodulation,[status(thm),theory(equality)],[c_35,c_238]) ).
tff(c_311,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_303,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI610_1 : TPTP v8.1.2. Released v5.1.0.
% 0.00/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.14/0.36 % Computer : n019.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 : Fri Aug 4 00:10:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.32/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/1.93
% 3.32/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.40/1.96
% 3.40/1.96 Inference rules
% 3.40/1.96 ----------------------
% 3.40/1.96 #Ref : 0
% 3.40/1.96 #Sup : 40
% 3.40/1.96 #Fact : 0
% 3.40/1.96 #Define : 4
% 3.40/1.96 #Split : 8
% 3.40/1.96 #Chain : 0
% 3.40/1.96 #Close : 1
% 3.40/1.96
% 3.40/1.96 Ordering : LPO
% 3.40/1.96
% 3.40/1.96 Simplification rules
% 3.40/1.96 ----------------------
% 3.40/1.96 #Subsume : 8
% 3.40/1.96 #Demod : 6
% 3.40/1.96 #Tautology : 11
% 3.40/1.96 #SimpNegUnit : 0
% 3.40/1.96 #BackRed : 0
% 3.40/1.96
% 3.40/1.96 #Partial instantiations: 0
% 3.40/1.96 #Strategies tried : 1
% 3.40/1.96
% 3.40/1.96 Timing (in seconds)
% 3.40/1.96 ----------------------
% 3.40/1.97 Preprocessing : 0.49
% 3.40/1.97 Parsing : 0.27
% 3.40/1.97 CNF conversion : 0.02
% 3.40/1.97 Main loop : 0.33
% 3.40/1.97 Inferencing : 0.06
% 3.40/1.97 Reduction : 0.07
% 3.40/1.97 Demodulation : 0.05
% 3.40/1.97 BG Simplification : 0.04
% 3.40/1.97 Subsumption : 0.07
% 3.40/1.97 Abstraction : 0.02
% 3.40/1.97 MUC search : 0.02
% 3.40/1.97 Cooper : 0.06
% 3.40/1.97 Total : 0.88
% 3.40/1.97 Index Insertion : 0.00
% 3.40/1.97 Index Deletion : 0.00
% 3.40/1.97 Index Matching : 0.00
% 3.40/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------