TSTP Solution File: SEU152+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU152+1 : TPTP v8.1.2. Released v3.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 : n025.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:47 EDT 2023
% Result : Theorem 2.79s 1.67s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 21 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > set_union2 > #nlpp > singleton > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(f_41,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> ( set_union2(singleton(A),B) = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
tff(f_45,axiom,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
tff(f_51,axiom,
! [A,B] :
( subset(A,B)
=> ( set_union2(A,B) = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
tff(f_33,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(c_14,plain,
in('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_83,plain,
! [A_23,B_24] :
( subset(singleton(A_23),B_24)
| ~ in(A_23,B_24) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_22,plain,
! [A_11,B_12] :
( ( set_union2(A_11,B_12) = B_12 )
| ~ subset(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_97,plain,
! [A_27,B_28] :
( ( set_union2(singleton(A_27),B_28) = B_28 )
| ~ in(A_27,B_28) ),
inference(resolution,[status(thm)],[c_83,c_22]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_union2(B_4,A_3) = set_union2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_134,plain,
! [B_29,A_30] :
( ( set_union2(B_29,singleton(A_30)) = B_29 )
| ~ in(A_30,B_29) ),
inference(superposition,[status(thm),theory(equality)],[c_97,c_4]) ).
tff(c_12,plain,
set_union2(singleton('#skF_1'),'#skF_2') != '#skF_2',
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_23,plain,
set_union2('#skF_2',singleton('#skF_1')) != '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_4,c_12]) ).
tff(c_150,plain,
~ in('#skF_1','#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_134,c_23]) ).
tff(c_178,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.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.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:14:04 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.79/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.67
% 2.79/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.79/1.69
% 2.79/1.69 Inference rules
% 2.79/1.69 ----------------------
% 2.79/1.69 #Ref : 0
% 2.79/1.69 #Sup : 35
% 2.79/1.69 #Fact : 0
% 2.79/1.69 #Define : 0
% 2.79/1.69 #Split : 0
% 2.79/1.69 #Chain : 0
% 2.79/1.69 #Close : 0
% 2.79/1.69
% 2.79/1.69 Ordering : KBO
% 2.79/1.69
% 2.79/1.69 Simplification rules
% 2.79/1.69 ----------------------
% 2.79/1.69 #Subsume : 2
% 2.79/1.69 #Demod : 5
% 2.79/1.69 #Tautology : 19
% 2.79/1.69 #SimpNegUnit : 0
% 2.79/1.69 #BackRed : 0
% 2.79/1.69
% 2.79/1.69 #Partial instantiations: 0
% 2.79/1.69 #Strategies tried : 1
% 2.79/1.69
% 2.79/1.69 Timing (in seconds)
% 2.79/1.69 ----------------------
% 2.79/1.69 Preprocessing : 0.41
% 2.79/1.69 Parsing : 0.23
% 2.79/1.69 CNF conversion : 0.02
% 2.79/1.69 Main loop : 0.22
% 2.79/1.69 Inferencing : 0.10
% 2.79/1.69 Reduction : 0.06
% 2.79/1.69 Demodulation : 0.04
% 2.79/1.70 BG Simplification : 0.01
% 2.79/1.70 Subsumption : 0.05
% 2.79/1.70 Abstraction : 0.01
% 2.79/1.70 MUC search : 0.00
% 2.79/1.70 Cooper : 0.00
% 2.79/1.70 Total : 0.68
% 2.79/1.70 Index Insertion : 0.00
% 2.79/1.70 Index Deletion : 0.00
% 2.79/1.70 Index Matching : 0.00
% 2.79/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------