TSTP Solution File: ARI606_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI606_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:06 EDT 2023
% Result : Theorem 2.97s 1.80s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 33 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 47 ( 24 atm; 0 fun; 13 num; 10 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 : 7 ( 5 usr; 6 con; 0-1 aty)
% Number of variables : 10 (; 10 !; 0 ?; 10 :)
% 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 ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_34,negated_conjecture,
~ ( ! [Xa: $int,Ya: $int] :
( $lesseq(Xa,Ya)
=> $lesseq(f(Xa),f(Ya)) )
=> $lesseq(f(f(2)),f(f(5))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_mon_implies_ff2_gt_ff5) ).
tff(c_2,plain,
~ $lesseq(f(f(2)),f(f(5))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_7,plain,
$less(f(f(5)),f(f(2))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_13,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_7]) ).
tff(c_14,plain,
f(2) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_7]) ).
tff(c_4,plain,
! [X_1a: $int,Y_2a: $int] :
( $lesseq(f(X_1a),f(Y_2a))
| ~ $lesseq(X_1a,Y_2a) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_30,plain,
! [Y_7a: $int,X_8a: $int] :
( ~ $less(f(Y_7a),f(X_8a))
| $less(Y_7a,X_8a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_208,plain,
! [Y_33a: $int] :
( ~ $less(f(Y_33a),'#skE_2')
| $less(Y_33a,2) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_30]) ).
tff(c_228,plain,
( ~ $less('#skE_1','#skE_2')
| $less(5,2) ),
inference(superposition,[status(thm),theory(equality)],[c_13,c_208]) ).
tff(c_230,plain,
~ $less('#skE_1','#skE_2'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_228]) ).
tff(c_9,plain,
f(2) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_7]) ).
tff(c_8,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_7]) ).
tff(c_17,plain,
$less(f('#skE_1'),f('#skE_2')),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_8,c_7]) ).
tff(c_62,plain,
f('#skE_2') = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_61,plain,
f('#skE_1') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_60,plain,
$less(f('#skE_1'),f('#skE_2')),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_8,c_7]) ).
tff(c_73,plain,
$less('#skE_3','#skE_4'),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_61,c_60]) ).
tff(c_72,plain,
f('#skE_2') = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_76,plain,
f('#skE_1') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_6,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_4]) ).
tff(c_268,plain,
! [X_38a: $int] :
( ~ $less('#skE_3',f(X_38a))
| $less('#skE_1',X_38a) ),
inference(superposition,[status(thm),theory(equality)],[c_76,c_6]) ).
tff(c_271,plain,
( ~ $less('#skE_3','#skE_4')
| $less('#skE_1','#skE_2') ),
inference(superposition,[status(thm),theory(equality)],[c_72,c_268]) ).
tff(c_283,plain,
$less('#skE_1','#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_73,c_271]) ).
tff(c_285,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_230,c_283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI606_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.15/0.34 % Computer : n014.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri Aug 4 00:03:33 EDT 2023
% 0.15/0.34 % CPUTime :
% 2.97/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.80
% 3.05/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.05/1.83
% 3.05/1.83 Inference rules
% 3.05/1.83 ----------------------
% 3.05/1.83 #Ref : 0
% 3.05/1.83 #Sup : 42
% 3.05/1.83 #Fact : 0
% 3.05/1.83 #Define : 4
% 3.05/1.83 #Split : 9
% 3.05/1.83 #Chain : 0
% 3.05/1.83 #Close : 0
% 3.05/1.83
% 3.05/1.83 Ordering : LPO
% 3.05/1.83
% 3.05/1.83 Simplification rules
% 3.05/1.83 ----------------------
% 3.05/1.83 #Subsume : 6
% 3.05/1.83 #Demod : 5
% 3.05/1.83 #Tautology : 12
% 3.05/1.83 #SimpNegUnit : 1
% 3.05/1.83 #BackRed : 0
% 3.05/1.83
% 3.05/1.83 #Partial instantiations: 0
% 3.05/1.83 #Strategies tried : 1
% 3.05/1.83
% 3.05/1.83 Timing (in seconds)
% 3.05/1.83 ----------------------
% 3.05/1.83 Preprocessing : 0.43
% 3.05/1.83 Parsing : 0.25
% 3.05/1.83 CNF conversion : 0.02
% 3.05/1.83 Main loop : 0.29
% 3.05/1.83 Inferencing : 0.06
% 3.05/1.83 Reduction : 0.07
% 3.05/1.83 Demodulation : 0.06
% 3.05/1.83 BG Simplification : 0.03
% 3.05/1.84 Subsumption : 0.06
% 3.05/1.84 Abstraction : 0.01
% 3.05/1.84 MUC search : 0.00
% 3.05/1.84 Cooper : 0.02
% 3.05/1.84 Total : 0.76
% 3.05/1.84 Index Insertion : 0.00
% 3.05/1.84 Index Deletion : 0.00
% 3.05/1.84 Index Matching : 0.00
% 3.05/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------