TSTP Solution File: ARI691_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI691_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 : n027.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:15 EDT 2023
% Result : Theorem 2.89s 1.64s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 18 ( 0 atm; 14 fun; 0 num; 4 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_64,axiom,
! [A: $int,B: $int] : ( $product(A,B) = $product(B,A) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',mult_comm) ).
tff(f_30,axiom,
$product(a,b) = f($product(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq) ).
tff(f_32,negated_conjecture,
f(f($product(a,b))) != $product(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(c_45,plain,
! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_49,plain,
f($product(a,b)) = $product(a,b),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_31,plain,
$product(b,a) != f(f($product(a,b))),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_56,plain,
$product(b,a) != $product(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_49,c_31]) ).
tff(c_63,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_45,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI691_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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 4 00:34:39 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.89/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.64
% 2.89/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.89/1.66
% 2.89/1.66 Inference rules
% 2.89/1.66 ----------------------
% 2.89/1.66 #Ref : 0
% 2.89/1.66 #Sup : 0
% 2.89/1.66 #Fact : 0
% 2.89/1.66 #Define : 0
% 2.89/1.66 #Split : 0
% 2.89/1.66 #Chain : 0
% 2.89/1.66 #Close : 0
% 2.89/1.66
% 2.89/1.66 Ordering : LPO
% 2.89/1.66
% 2.89/1.66 Simplification rules
% 2.89/1.66 ----------------------
% 2.89/1.66 #Subsume : 0
% 2.89/1.66 #Demod : 3
% 2.89/1.66 #Tautology : 0
% 2.89/1.66 #SimpNegUnit : 0
% 2.89/1.66 #BackRed : 0
% 2.89/1.66
% 2.89/1.66 #Partial instantiations: 0
% 2.89/1.66 #Strategies tried : 1
% 2.89/1.66
% 2.89/1.66 Timing (in seconds)
% 2.89/1.66 ----------------------
% 2.89/1.67 Preprocessing : 0.57
% 2.89/1.67 Parsing : 0.30
% 2.89/1.67 CNF conversion : 0.02
% 2.89/1.67 Main loop : 0.06
% 2.89/1.67 Inferencing : 0.00
% 2.89/1.67 Reduction : 0.03
% 2.89/1.67 Demodulation : 0.02
% 2.89/1.67 BG Simplification : 0.04
% 2.89/1.67 Subsumption : 0.02
% 2.89/1.67 Abstraction : 0.01
% 2.89/1.67 MUC search : 0.00
% 2.89/1.67 Cooper : 0.00
% 2.89/1.67 Total : 0.67
% 2.89/1.67 Index Insertion : 0.00
% 2.89/1.67 Index Deletion : 0.00
% 2.89/1.67 Index Matching : 0.00
% 3.04/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------