TSTP Solution File: SEU155+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU155+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 : n028.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:48 EDT 2023
% Result : Theorem 2.98s 1.79s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 24 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 19 ( 7 ~; 6 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 8 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 18 (; 17 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > #nlpp > union > #skF_7 > #skF_3 > #skF_6 > #skF_5 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_54,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
tff(f_38,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_48,axiom,
! [A,B] :
( ( B = union(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(C,D)
& in(D,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
tff(c_30,plain,
~ subset('#skF_6',union('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_8,plain,
! [A_3,B_4] :
( in('#skF_1'(A_3,B_4),A_3)
| subset(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_32,plain,
in('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_66,plain,
! [C_42,A_43,D_44] :
( in(C_42,union(A_43))
| ~ in(D_44,A_43)
| ~ in(C_42,D_44) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_73,plain,
! [C_45] :
( in(C_45,union('#skF_7'))
| ~ in(C_45,'#skF_6') ),
inference(resolution,[status(thm)],[c_32,c_66]) ).
tff(c_6,plain,
! [A_3,B_4] :
( ~ in('#skF_1'(A_3,B_4),B_4)
| subset(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_114,plain,
! [A_51] :
( subset(A_51,union('#skF_7'))
| ~ in('#skF_1'(A_51,union('#skF_7')),'#skF_6') ),
inference(resolution,[status(thm)],[c_73,c_6]) ).
tff(c_118,plain,
subset('#skF_6',union('#skF_7')),
inference(resolution,[status(thm)],[c_8,c_114]) ).
tff(c_122,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_30,c_118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU155+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.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:26:08 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.98/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.98/1.80
% 2.98/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.98/1.82
% 2.98/1.82 Inference rules
% 2.98/1.82 ----------------------
% 2.98/1.82 #Ref : 0
% 2.98/1.82 #Sup : 19
% 2.98/1.82 #Fact : 0
% 2.98/1.82 #Define : 0
% 2.98/1.82 #Split : 0
% 2.98/1.82 #Chain : 0
% 2.98/1.82 #Close : 0
% 2.98/1.82
% 2.98/1.82 Ordering : KBO
% 2.98/1.82
% 2.98/1.82 Simplification rules
% 2.98/1.82 ----------------------
% 2.98/1.82 #Subsume : 1
% 2.98/1.82 #Demod : 2
% 2.98/1.82 #Tautology : 3
% 2.98/1.82 #SimpNegUnit : 1
% 2.98/1.82 #BackRed : 0
% 2.98/1.82
% 2.98/1.82 #Partial instantiations: 0
% 2.98/1.82 #Strategies tried : 1
% 2.98/1.82
% 2.98/1.82 Timing (in seconds)
% 2.98/1.82 ----------------------
% 2.98/1.82 Preprocessing : 0.47
% 2.98/1.82 Parsing : 0.25
% 2.98/1.82 CNF conversion : 0.04
% 2.98/1.82 Main loop : 0.23
% 2.98/1.82 Inferencing : 0.09
% 2.98/1.83 Reduction : 0.06
% 2.98/1.83 Demodulation : 0.04
% 2.98/1.83 BG Simplification : 0.02
% 2.98/1.83 Subsumption : 0.06
% 2.98/1.83 Abstraction : 0.01
% 2.98/1.83 MUC search : 0.00
% 2.98/1.83 Cooper : 0.00
% 2.98/1.83 Total : 0.74
% 2.98/1.83 Index Insertion : 0.00
% 2.98/1.83 Index Deletion : 0.00
% 2.98/1.83 Index Matching : 0.00
% 2.98/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------