TSTP Solution File: ARI602_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI602_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 : n014.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:05 EDT 2023
% Result : Theorem 2.12s 1.62s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 15 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 28 ( 12 atm; 0 fun; 10 num; 6 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 : 4 ( 2 usr; 3 con; 0-1 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_35,negated_conjecture,
~ ( ! [Xa: $int] : $greater(f(Xa),Xa)
=> ? [Ya: $int] :
( $less(4,Ya)
& $less(Ya,f(5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fX_gt_X_implies_exist_ineq) ).
tff(c_6,plain,
! [Y_2a: $int] :
( ~ $less(Y_2a,f(5))
| ~ $less(4,Y_2a) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_6]) ).
tff(c_12,plain,
! [Y_2a: $int] :
( ~ $less(Y_2a,'#skE_1')
| ~ $less(4,Y_2a) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_23,plain,
$lesseq('#skE_1',5),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_12]) ).
tff(c_25,plain,
~ $less(5,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_23]) ).
tff(c_11,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_6]) ).
tff(c_3,plain,
! [X_1a: $int] : $greater(f(X_1a),X_1a),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_5,plain,
! [X_1a: $int] : $less(X_1a,f(X_1a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_20,plain,
$less(5,'#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_11,c_5]) ).
tff(c_26,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_25,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI602_1 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.13 % 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.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Fri Aug 4 00:04:03 EDT 2023
% 0.17/0.35 % CPUTime :
% 2.12/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.12/1.62
% 2.12/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.75/1.65
% 2.75/1.65 Inference rules
% 2.75/1.65 ----------------------
% 2.75/1.65 #Ref : 0
% 2.75/1.65 #Sup : 3
% 2.75/1.65 #Fact : 0
% 2.75/1.65 #Define : 1
% 2.75/1.65 #Split : 0
% 2.75/1.65 #Chain : 0
% 2.75/1.65 #Close : 1
% 2.75/1.65
% 2.75/1.65 Ordering : LPO
% 2.75/1.65
% 2.75/1.65 Simplification rules
% 2.75/1.65 ----------------------
% 2.75/1.65 #Subsume : 0
% 2.75/1.65 #Demod : 1
% 2.75/1.65 #Tautology : 2
% 2.75/1.65 #SimpNegUnit : 0
% 2.75/1.65 #BackRed : 0
% 2.75/1.65
% 2.75/1.65 #Partial instantiations: 0
% 2.75/1.65 #Strategies tried : 1
% 2.75/1.65
% 2.75/1.65 Timing (in seconds)
% 2.75/1.65 ----------------------
% 2.75/1.66 Preprocessing : 0.43
% 2.75/1.66 Parsing : 0.25
% 2.75/1.66 CNF conversion : 0.02
% 2.75/1.66 Main loop : 0.16
% 2.75/1.66 Inferencing : 0.04
% 2.75/1.66 Reduction : 0.02
% 2.75/1.66 Demodulation : 0.02
% 2.75/1.66 BG Simplification : 0.02
% 2.75/1.66 Subsumption : 0.02
% 2.75/1.66 Abstraction : 0.00
% 2.75/1.66 MUC search : 0.00
% 2.75/1.66 Cooper : 0.03
% 2.75/1.66 Total : 0.64
% 2.75/1.66 Index Insertion : 0.00
% 2.75/1.66 Index Deletion : 0.00
% 2.75/1.66 Index Matching : 0.00
% 2.75/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------