TSTP Solution File: ARI609_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI609_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/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 : n010.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 2.91s 1.75s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 12 unt; 5 typ; 0 def)
% Number of atoms : 24 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 4 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 38 ( 19 atm; 8 fun; 4 num; 7 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 : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $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)) )
& $lesseq(0,$sum(a,$uminus(b))) )
=> $lesseq(0,$sum(f(a),$uminus(f(b)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_mon_implies_f_a_b_1) ).
tff(c_4,plain,
$lesseq(0,$sum(a,$uminus(b))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_9,plain,
~ $less(a,b),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_2,plain,
~ $lesseq(0,$sum(f(a),$uminus(f(b)))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_13,plain,
$less(f(a),f(b)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_18,plain,
f(b) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_17,plain,
f(a) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_15,plain,
$less(f(a),f(b)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_29,plain,
$less('#skE_1','#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_17,c_15]) ).
tff(c_25,plain,
f(a) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_61,plain,
f(b) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_13]) ).
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_102,plain,
! [Y_23a: $int] :
( ~ $less(f(Y_23a),'#skE_2')
| $less(Y_23a,b) ),
inference(superposition,[status(thm),theory(equality)],[c_61,c_8]) ).
tff(c_108,plain,
( ~ $less('#skE_1','#skE_2')
| $less(a,b) ),
inference(superposition,[status(thm),theory(equality)],[c_25,c_102]) ).
tff(c_114,plain,
$less(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_29,c_108]) ).
tff(c_116,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI609_1 : TPTP v8.1.2. Released v5.1.0.
% 0.14/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.14/0.36 % Computer : n010.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 23:57:43 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.91/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.76
% 2.91/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.79
% 3.01/1.79 Inference rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Ref : 0
% 3.01/1.79 #Sup : 12
% 3.01/1.79 #Fact : 0
% 3.01/1.79 #Define : 2
% 3.01/1.79 #Split : 1
% 3.01/1.79 #Chain : 0
% 3.01/1.79 #Close : 0
% 3.01/1.79
% 3.01/1.79 Ordering : LPO
% 3.01/1.79
% 3.01/1.79 Simplification rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Subsume : 1
% 3.01/1.79 #Demod : 3
% 3.01/1.79 #Tautology : 5
% 3.01/1.79 #SimpNegUnit : 1
% 3.01/1.79 #BackRed : 0
% 3.01/1.79
% 3.01/1.79 #Partial instantiations: 0
% 3.01/1.79 #Strategies tried : 1
% 3.01/1.79
% 3.01/1.79 Timing (in seconds)
% 3.01/1.79 ----------------------
% 3.01/1.79 Preprocessing : 0.46
% 3.01/1.79 Parsing : 0.26
% 3.01/1.79 CNF conversion : 0.02
% 3.01/1.79 Main loop : 0.19
% 3.01/1.79 Inferencing : 0.05
% 3.01/1.79 Reduction : 0.04
% 3.01/1.79 Demodulation : 0.03
% 3.01/1.79 BG Simplification : 0.02
% 3.01/1.79 Subsumption : 0.05
% 3.01/1.79 Abstraction : 0.01
% 3.01/1.79 MUC search : 0.00
% 3.01/1.79 Cooper : 0.02
% 3.01/1.79 Total : 0.70
% 3.01/1.79 Index Insertion : 0.00
% 3.01/1.79 Index Deletion : 0.00
% 3.01/1.79 Index Matching : 0.00
% 3.01/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------