TSTP Solution File: ARI181_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI181_1 : TPTP v8.1.2. Released v5.0.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 : n008.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:33:19 EDT 2023
% Result : Theorem 2.96s 1.76s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 19 unt; 4 typ; 0 def)
% Number of atoms : 21 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 31 ( 14 atm; 0 fun; 14 num; 3 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 : 6 ( 4 usr; 5 con; 0-1 aty)
% Number of variables : 3 (; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_33,negated_conjecture,
~ ( ! [Ua: $int] : $greater(f(Ua),Ua)
=> $greatereq(f(f(f(6))),9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_2,plain,
~ $greatereq(f(f(f(6))),9),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_8,plain,
$less(f(f(f(6))),9),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_10,plain,
f(6) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_8]) ).
tff(c_17,plain,
$less(f(f('#skE_1')),9),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_8]) ).
tff(c_30,plain,
f('#skE_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_29,plain,
$less(f(f('#skE_1')),9),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_8]) ).
tff(c_40,plain,
$less(f('#skE_2'),9),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_29]) ).
tff(c_83,plain,
f('#skE_2') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_40]) ).
tff(c_5,plain,
! [U_1a: $int] : $greater(f(U_1a),U_1a),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_7,plain,
! [U_1a: $int] : $less(U_1a,f(U_1a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_112,plain,
$less('#skE_2','#skE_3'),
inference(superposition,[status(thm),theory(equality)],[c_83,c_7]) ).
tff(c_73,plain,
f('#skE_2') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_40]) ).
tff(c_72,plain,
$less(f('#skE_2'),9),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_29]) ).
tff(c_80,plain,
$less('#skE_3',9),
inference(demodulation,[status(thm),theory(equality)],[c_73,c_72]) ).
tff(c_43,plain,
f('#skE_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_64,plain,
$less('#skE_1','#skE_2'),
inference(superposition,[status(thm),theory(equality)],[c_43,c_7]) ).
tff(c_14,plain,
f(6) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_8]) ).
tff(c_25,plain,
$less(6,'#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_14,c_7]) ).
tff(c_119,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_112,c_80,c_64,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI181_1 : TPTP v8.1.2. Released v5.0.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 : n008.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:13:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.96/1.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/1.77
% 2.96/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.80
% 2.96/1.80 Inference rules
% 2.96/1.80 ----------------------
% 2.96/1.80 #Ref : 0
% 2.96/1.80 #Sup : 15
% 2.96/1.80 #Fact : 0
% 2.96/1.80 #Define : 3
% 2.96/1.80 #Split : 1
% 2.96/1.80 #Chain : 0
% 2.96/1.80 #Close : 1
% 2.96/1.80
% 2.96/1.80 Ordering : LPO
% 2.96/1.80
% 2.96/1.80 Simplification rules
% 2.96/1.80 ----------------------
% 2.96/1.80 #Subsume : 1
% 2.96/1.80 #Demod : 3
% 2.96/1.80 #Tautology : 6
% 2.96/1.80 #SimpNegUnit : 0
% 2.96/1.80 #BackRed : 0
% 2.96/1.80
% 2.96/1.80 #Partial instantiations: 0
% 2.96/1.80 #Strategies tried : 1
% 2.96/1.80
% 2.96/1.80 Timing (in seconds)
% 2.96/1.80 ----------------------
% 2.96/1.80 Preprocessing : 0.45
% 2.96/1.80 Parsing : 0.26
% 2.96/1.80 CNF conversion : 0.02
% 2.96/1.80 Main loop : 0.24
% 2.96/1.80 Inferencing : 0.04
% 2.96/1.80 Reduction : 0.05
% 2.96/1.80 Demodulation : 0.05
% 2.96/1.80 BG Simplification : 0.03
% 2.96/1.80 Subsumption : 0.05
% 2.96/1.80 Abstraction : 0.01
% 2.96/1.80 MUC search : 0.01
% 2.96/1.80 Cooper : 0.04
% 2.96/1.80 Total : 0.74
% 2.96/1.80 Index Insertion : 0.00
% 2.96/1.80 Index Deletion : 0.00
% 2.96/1.80 Index Matching : 0.00
% 2.96/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------