TSTP Solution File: ARI632_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI632_1 : TPTP v8.1.2. Released v6.3.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 : n028.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:09 EDT 2023
% Result : Theorem 3.43s 2.02s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 28 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 15 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 37 ( 22 atm; 8 fun; 0 num; 7 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $real ).
tff(u,type,
u: $real ).
tff(x,type,
x: $real ).
tff('#skE_2',type,
'#skE_2': $real ).
tff(y,type,
y: $real ).
tff(v,type,
v: $real ).
%Foreground operators:
tff(f,type,
f: $real > $real ).
tff(f_37,negated_conjecture,
~ $less($sum(u,f(x)),$sum(v,f(y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion) ).
tff(f_33,axiom,
! [Xa: $real,Ya: $real] :
( $greatereq(Xa,Ya)
=> $greatereq(f(Xa),f(Ya)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_non_decreasing) ).
tff(f_35,hypothesis,
$lesseq(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypothesis_01) ).
tff(f_34,hypothesis,
$less(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypothesis) ).
tff(c_11,plain,
~ $less($sum(u,f(x)),$sum(v,f(y))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_22,plain,
f(x) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_52,plain,
f(y) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_1,plain,
! [X_1a: $real,Y_2a: $real] :
( $greatereq(f(X_1a),f(Y_2a))
| ~ $greatereq(X_1a,Y_2a) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
! [X_1a: $real,Y_2a: $real] :
( ~ $less(f(X_1a),f(Y_2a))
| ~ $lesseq(Y_2a,X_1a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_99,plain,
! [Y_30a: $real] :
( ~ $less('#skE_2',f(Y_30a))
| ~ $lesseq(Y_30a,y) ),
inference(superposition,[status(thm),theory(equality)],[c_52,c_2]) ).
tff(c_108,plain,
( ~ $less('#skE_2','#skE_1')
| ~ $lesseq(x,y) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_99]) ).
tff(c_109,plain,
~ $lesseq(x,y),
inference(splitLeft,[status(thm)],[c_108]) ).
tff(c_5,plain,
$lesseq(x,y),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_6,plain,
~ $less(y,x),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_122,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_109,c_6]) ).
tff(c_123,plain,
~ $less('#skE_2','#skE_1'),
inference(splitRight,[status(thm)],[c_108]) ).
tff(c_16,plain,
f(y) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_15,plain,
f(x) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_12,plain,
~ $less($sum(u,f(x)),$sum(v,f(y))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_18,plain,
~ $less($sum(u,'#skE_1'),$sum(v,'#skE_2')),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_15,c_12]) ).
tff(c_3,plain,
$less(u,v),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_4,plain,
~ $lesseq(v,u),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_126,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_123,c_18,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI632_1 : TPTP v8.1.2. Released v6.3.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 : n028.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 : Fri Aug 4 00:24:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.43/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.43/2.03
% 3.43/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.53/2.08
% 3.53/2.08 Inference rules
% 3.53/2.08 ----------------------
% 3.53/2.08 #Ref : 0
% 3.53/2.08 #Sup : 16
% 3.53/2.08 #Fact : 0
% 3.53/2.08 #Define : 2
% 3.53/2.08 #Split : 3
% 3.53/2.08 #Chain : 0
% 3.53/2.08 #Close : 2
% 3.53/2.08
% 3.53/2.08 Ordering : LPO
% 3.53/2.08
% 3.53/2.08 Simplification rules
% 3.53/2.08 ----------------------
% 3.53/2.08 #Subsume : 1
% 3.53/2.08 #Demod : 2
% 3.53/2.08 #Tautology : 7
% 3.53/2.08 #SimpNegUnit : 0
% 3.53/2.08 #BackRed : 0
% 3.53/2.08
% 3.53/2.08 #Partial instantiations: 0
% 3.53/2.08 #Strategies tried : 1
% 3.53/2.08
% 3.53/2.08 Timing (in seconds)
% 3.53/2.08 ----------------------
% 3.53/2.08 Preprocessing : 0.55
% 3.53/2.08 Parsing : 0.26
% 3.53/2.08 CNF conversion : 0.02
% 3.53/2.08 Main loop : 0.38
% 3.53/2.08 Inferencing : 0.05
% 3.53/2.08 Reduction : 0.04
% 3.53/2.08 Demodulation : 0.03
% 3.53/2.08 BG Simplification : 0.02
% 3.53/2.08 Subsumption : 0.05
% 3.53/2.08 Abstraction : 0.01
% 3.53/2.08 MUC search : 0.09
% 3.53/2.08 Cooper : 0.00
% 3.53/2.08 Total : 1.00
% 3.53/2.08 Index Insertion : 0.00
% 3.53/2.08 Index Deletion : 0.00
% 3.53/2.08 Index Matching : 0.00
% 3.53/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------