TSTP Solution File: SET786-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET786-1 : TPTP v8.1.2. Released v2.5.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 : n002.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:57:00 EDT 2023
% Result : Unsatisfiable 2.73s 1.64s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 15 unt; 3 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 45 ( 27 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > sk2 > sk1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sk2,type,
sk2: $i > $i ).
tff(sk1,type,
sk1: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(f_34,axiom,
! [A] :
( element(A,sk1)
| element(A,sk2(A)) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [A] :
( element(A,sk1)
| element(sk2(A),A) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [B,A] :
( ~ element(B,A)
| ~ element(A,B)
| ~ element(A,sk1) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_3] :
( element(A_3,sk2(A_3))
| element(A_3,sk1) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_6,plain,
! [A_4] :
( element(sk2(A_4),A_4)
| element(A_4,sk1) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_9,plain,
! [A_7,B_8] :
( ~ element(A_7,sk1)
| ~ element(A_7,B_8)
| ~ element(B_8,A_7) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_13,plain,
! [B_8] :
( ~ element(sk2(sk1),B_8)
| ~ element(B_8,sk2(sk1))
| element(sk1,sk1) ),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_15,plain,
! [B_9] :
( ~ element(sk2(sk1),B_9)
| ~ element(B_9,sk2(sk1)) ),
inference(splitLeft,[status(thm)],[c_13]) ).
tff(c_23,plain,
( ~ element(sk1,sk2(sk1))
| element(sk1,sk1) ),
inference(resolution,[status(thm)],[c_6,c_15]) ).
tff(c_24,plain,
~ element(sk1,sk2(sk1)),
inference(splitLeft,[status(thm)],[c_23]) ).
tff(c_28,plain,
element(sk1,sk1),
inference(resolution,[status(thm)],[c_4,c_24]) ).
tff(c_2,plain,
! [A_2,B_1] :
( ~ element(A_2,sk1)
| ~ element(A_2,B_1)
| ~ element(B_1,A_2) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_32,plain,
! [B_10] :
( ~ element(sk1,B_10)
| ~ element(B_10,sk1) ),
inference(resolution,[status(thm)],[c_28,c_2]) ).
tff(c_34,plain,
~ element(sk1,sk1),
inference(resolution,[status(thm)],[c_28,c_32]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_34]) ).
tff(c_43,plain,
element(sk1,sk2(sk1)),
inference(splitRight,[status(thm)],[c_23]) ).
tff(c_22,plain,
( ~ element(sk2(sk2(sk1)),sk2(sk1))
| element(sk2(sk1),sk1) ),
inference(resolution,[status(thm)],[c_4,c_15]) ).
tff(c_44,plain,
~ element(sk2(sk2(sk1)),sk2(sk1)),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_51,plain,
element(sk2(sk1),sk1),
inference(resolution,[status(thm)],[c_6,c_44]) ).
tff(c_14,plain,
! [B_8] :
( ~ element(sk2(sk1),B_8)
| ~ element(B_8,sk2(sk1)) ),
inference(splitLeft,[status(thm)],[c_13]) ).
tff(c_53,plain,
~ element(sk1,sk2(sk1)),
inference(resolution,[status(thm)],[c_51,c_14]) ).
tff(c_59,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_43,c_53]) ).
tff(c_60,plain,
element(sk2(sk1),sk1),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_66,plain,
~ element(sk1,sk2(sk1)),
inference(resolution,[status(thm)],[c_60,c_14]) ).
tff(c_72,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_43,c_66]) ).
tff(c_73,plain,
element(sk1,sk1),
inference(splitRight,[status(thm)],[c_13]) ).
tff(c_77,plain,
! [B_11] :
( ~ element(sk1,B_11)
| ~ element(B_11,sk1) ),
inference(resolution,[status(thm)],[c_73,c_2]) ).
tff(c_79,plain,
~ element(sk1,sk1),
inference(resolution,[status(thm)],[c_73,c_77]) ).
tff(c_86,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_73,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET786-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.15 % 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.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 16:32:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.73/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.64
% 2.73/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.73/1.68
% 2.73/1.68 Inference rules
% 2.73/1.68 ----------------------
% 2.73/1.68 #Ref : 0
% 2.73/1.68 #Sup : 17
% 2.73/1.68 #Fact : 0
% 2.73/1.68 #Define : 0
% 2.73/1.68 #Split : 3
% 2.73/1.68 #Chain : 0
% 2.73/1.68 #Close : 0
% 2.73/1.68
% 2.73/1.68 Ordering : KBO
% 2.73/1.68
% 2.73/1.68 Simplification rules
% 2.73/1.68 ----------------------
% 2.73/1.68 #Subsume : 0
% 2.73/1.68 #Demod : 4
% 2.73/1.68 #Tautology : 0
% 2.73/1.68 #SimpNegUnit : 0
% 2.73/1.68 #BackRed : 0
% 2.73/1.68
% 2.73/1.68 #Partial instantiations: 0
% 2.73/1.68 #Strategies tried : 1
% 2.73/1.68
% 2.73/1.68 Timing (in seconds)
% 2.73/1.68 ----------------------
% 2.73/1.68 Preprocessing : 0.39
% 2.73/1.68 Parsing : 0.22
% 2.73/1.68 CNF conversion : 0.02
% 2.73/1.68 Main loop : 0.21
% 2.73/1.68 Inferencing : 0.10
% 2.73/1.68 Reduction : 0.03
% 2.73/1.68 Demodulation : 0.02
% 2.73/1.68 BG Simplification : 0.01
% 2.73/1.68 Subsumption : 0.05
% 2.73/1.68 Abstraction : 0.01
% 2.73/1.68 MUC search : 0.00
% 2.73/1.68 Cooper : 0.00
% 2.73/1.68 Total : 0.65
% 2.73/1.68 Index Insertion : 0.00
% 2.73/1.68 Index Deletion : 0.00
% 2.73/1.68 Index Matching : 0.00
% 2.73/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------