TSTP Solution File: ARI186_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI186_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 : n012.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:20 EDT 2023
% Result : Theorem 2.97s 1.78s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 56 ( 0 atm; 4 fun; 46 num; 6 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 5 usr; 8 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ g > #nlpp
%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(g,type,
g: ( $int * $int ) > $int ).
tff(f_35,negated_conjecture,
~ ( ! [Ua: $int,Va: $int] : ( g(Ua,Va) = g(Ua,$sum(Va,2)) )
=> ( ( g(3,3) = g(3,4) )
=> ( g(3,2) = g(3,5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_11,plain,
g(3,4) = g(3,3),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_19,plain,
g(3,4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_55,plain,
! [U_5a: $int,V_7a: $int] : ( g(U_5a,$sum(2,V_7a)) = g(U_5a,V_7a) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_118,plain,
! [V_7a: $int] :
( ( g(3,V_7a) = '#skE_1' )
| ( $sum(2,V_7a) != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_19,c_55]) ).
tff(c_198,plain,
g(3,2) = '#skE_1',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_118]) ).
tff(c_12,plain,
g(3,5) != g(3,2),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_41,plain,
g(3,2) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_270,plain,
'#skE_4' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_198,c_41]) ).
tff(c_37,plain,
g(3,2) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_36,plain,
g(3,5) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_42,plain,
'#skE_4' != '#skE_3',
inference(demodulation,[status(thm),theory(equality)],[c_37,c_36,c_12]) ).
tff(c_303,plain,
'#skE_3' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_270,c_42]) ).
tff(c_16,plain,
g(3,3) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_15,plain,
g(3,4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_21,plain,
'#skE_2' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_16,c_15,c_11]) ).
tff(c_20,plain,
g(3,3) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_11]) ).
tff(c_23,plain,
g(3,3) = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_21,c_20]) ).
tff(c_40,plain,
g(3,5) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_12]) ).
tff(c_73,plain,
! [V_7a: $int] :
( ( g(3,V_7a) = '#skE_3' )
| ( $sum(2,V_7a) != 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_55,c_40]) ).
tff(c_149,plain,
g(3,3) = '#skE_3',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_73]) ).
tff(c_304,plain,
'#skE_3' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_23,c_149]) ).
tff(c_305,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_303,c_304]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI186_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14 % 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.16/0.35 % Computer : n012.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Fri Aug 4 00:06:52 EDT 2023
% 0.16/0.35 % CPUTime :
% 2.97/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.97/1.78
% 2.97/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.97/1.81
% 2.97/1.81 Inference rules
% 2.97/1.81 ----------------------
% 2.97/1.81 #Ref : 0
% 2.97/1.81 #Sup : 50
% 2.97/1.81 #Fact : 0
% 2.97/1.81 #Define : 4
% 2.97/1.81 #Split : 0
% 2.97/1.81 #Chain : 0
% 2.97/1.81 #Close : 0
% 2.97/1.81
% 2.97/1.81 Ordering : LPO
% 2.97/1.81
% 2.97/1.81 Simplification rules
% 2.97/1.81 ----------------------
% 2.97/1.81 #Subsume : 0
% 2.97/1.81 #Demod : 8
% 2.97/1.81 #Tautology : 18
% 2.97/1.81 #SimpNegUnit : 1
% 2.97/1.81 #BackRed : 2
% 2.97/1.81
% 2.97/1.81 #Partial instantiations: 0
% 2.97/1.81 #Strategies tried : 1
% 2.97/1.81
% 2.97/1.81 Timing (in seconds)
% 2.97/1.81 ----------------------
% 2.97/1.81 Preprocessing : 0.44
% 2.97/1.81 Parsing : 0.25
% 2.97/1.81 CNF conversion : 0.02
% 2.97/1.81 Main loop : 0.24
% 2.97/1.81 Inferencing : 0.06
% 2.97/1.81 Reduction : 0.06
% 2.97/1.81 Demodulation : 0.05
% 2.97/1.81 BG Simplification : 0.04
% 2.97/1.81 Subsumption : 0.04
% 2.97/1.81 Abstraction : 0.01
% 2.97/1.81 MUC search : 0.00
% 2.97/1.81 Cooper : 0.02
% 2.97/1.81 Total : 0.73
% 2.97/1.81 Index Insertion : 0.00
% 2.97/1.81 Index Deletion : 0.00
% 2.97/1.81 Index Matching : 0.00
% 2.97/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------