TSTP Solution File: REL049-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : REL049-1 : TPTP v8.1.2. Released v4.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 : n022.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:54:39 EDT 2023
% Result : Unsatisfiable 2.57s 1.60s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 21 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > composition > #nlpp > converse > complement > zero > top > sk3 > sk2 > sk1 > one
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(top,type,
top: $i ).
tff(sk2,type,
sk2: $i ).
tff(sk1,type,
sk1: $i ).
tff(converse,type,
converse: $i > $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(composition,type,
composition: ( $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff(one,type,
one: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(sk3,type,
sk3: $i ).
tff(zero,type,
zero: $i ).
tff(f_75,axiom,
join(sk1,sk2) = sk2,
file(unknown,unknown) ).
tff(f_76,axiom,
join(sk3,sk2) = sk2,
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B,C] : ( join(A,join(B,C)) = join(join(A,B),C) ),
file(unknown,unknown) ).
tff(f_78,axiom,
join(join(sk1,sk3),sk2) != sk2,
file(unknown,unknown) ).
tff(c_28,plain,
join(sk1,sk2) = sk2,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_30,plain,
join(sk3,sk2) = sk2,
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_4,plain,
! [A_3,B_4,C_5] : ( join(join(A_3,B_4),C_5) = join(A_3,join(B_4,C_5)) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_32,plain,
join(join(sk1,sk3),sk2) != sk2,
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_34,plain,
join(sk1,join(sk3,sk2)) != sk2,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_32]) ).
tff(c_36,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_30,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL049-1 : TPTP v8.1.2. Released v4.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.14/0.34 % Computer : n022.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 15:32:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.57/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/1.60
% 2.57/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.57/1.64
% 2.57/1.64 Inference rules
% 2.57/1.64 ----------------------
% 2.57/1.64 #Ref : 0
% 2.57/1.64 #Sup : 0
% 2.57/1.64 #Fact : 0
% 2.57/1.64 #Define : 0
% 2.57/1.64 #Split : 0
% 2.57/1.64 #Chain : 0
% 2.57/1.64 #Close : 0
% 2.57/1.64
% 2.57/1.64 Ordering : KBO
% 2.57/1.64
% 2.57/1.64 Simplification rules
% 2.57/1.64 ----------------------
% 2.57/1.64 #Subsume : 15
% 2.57/1.64 #Demod : 4
% 2.57/1.64 #Tautology : 0
% 2.57/1.64 #SimpNegUnit : 0
% 2.57/1.64 #BackRed : 0
% 2.57/1.64
% 2.57/1.64 #Partial instantiations: 0
% 2.57/1.64 #Strategies tried : 1
% 2.57/1.64
% 2.57/1.64 Timing (in seconds)
% 2.57/1.64 ----------------------
% 2.69/1.64 Preprocessing : 0.45
% 2.69/1.64 Parsing : 0.24
% 2.69/1.64 CNF conversion : 0.02
% 2.69/1.64 Main loop : 0.08
% 2.69/1.64 Inferencing : 0.00
% 2.69/1.64 Reduction : 0.04
% 2.69/1.64 Demodulation : 0.03
% 2.69/1.64 BG Simplification : 0.01
% 2.69/1.64 Subsumption : 0.03
% 2.69/1.64 Abstraction : 0.01
% 2.69/1.64 MUC search : 0.00
% 2.69/1.64 Cooper : 0.00
% 2.69/1.64 Total : 0.59
% 2.69/1.64 Index Insertion : 0.00
% 2.69/1.64 Index Deletion : 0.00
% 2.69/1.64 Index Matching : 0.00
% 2.69/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------