TSTP Solution File: SET958+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET958+1 : TPTP v8.1.2. Released v3.2.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 : n016.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:25 EDT 2023
% Result : Theorem 3.34s 1.88s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 25 ( 3 unt; 13 typ; 0 def)
% Number of atoms : 28 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 29 ( 13 ~; 10 |; 2 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > unordered_pair > ordered_pair > #nlpp > singleton > #skF_7 > #skF_5 > #skF_2 > #skF_3 > #skF_4 > #skF_1 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_68,negated_conjecture,
~ ! [A,B] :
( ( ! [C] :
~ ( in(C,A)
& ! [D,E] : ( C != ordered_pair(D,E) ) )
& ! [C,D] :
( in(ordered_pair(C,D),A)
=> in(ordered_pair(C,D),B) ) )
=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t111_zfmisc_1) ).
tff(f_40,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_22,plain,
~ subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_10,plain,
! [A_5,B_6] :
( in('#skF_1'(A_5,B_6),A_5)
| subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_26,plain,
! [C_23] :
( ( ordered_pair('#skF_6'(C_23),'#skF_7'(C_23)) = C_23 )
| ~ in(C_23,'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_130,plain,
! [C_49,D_50] :
( in(ordered_pair(C_49,D_50),'#skF_5')
| ~ in(ordered_pair(C_49,D_50),'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_325,plain,
! [C_70] :
( in(C_70,'#skF_5')
| ~ in(ordered_pair('#skF_6'(C_70),'#skF_7'(C_70)),'#skF_4')
| ~ in(C_70,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_130]) ).
tff(c_329,plain,
! [C_71] :
( in(C_71,'#skF_5')
| ~ in(C_71,'#skF_4')
| ~ in(C_71,'#skF_4')
| ~ in(C_71,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_325]) ).
tff(c_8,plain,
! [A_5,B_6] :
( ~ in('#skF_1'(A_5,B_6),B_6)
| subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_400,plain,
! [A_75] :
( subset(A_75,'#skF_5')
| ~ in('#skF_1'(A_75,'#skF_5'),'#skF_4') ),
inference(resolution,[status(thm)],[c_329,c_8]) ).
tff(c_408,plain,
subset('#skF_4','#skF_5'),
inference(resolution,[status(thm)],[c_10,c_400]) ).
tff(c_413,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_22,c_408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET958+1 : TPTP v8.1.2. Released v3.2.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.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:31:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.34/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.34/1.88
% 3.34/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/1.91
% 3.34/1.91 Inference rules
% 3.34/1.91 ----------------------
% 3.34/1.91 #Ref : 0
% 3.34/1.91 #Sup : 97
% 3.34/1.91 #Fact : 0
% 3.34/1.91 #Define : 0
% 3.34/1.91 #Split : 0
% 3.34/1.91 #Chain : 0
% 3.34/1.91 #Close : 0
% 3.34/1.91
% 3.34/1.91 Ordering : KBO
% 3.34/1.91
% 3.34/1.91 Simplification rules
% 3.34/1.91 ----------------------
% 3.34/1.91 #Subsume : 1
% 3.34/1.91 #Demod : 22
% 3.34/1.91 #Tautology : 39
% 3.34/1.91 #SimpNegUnit : 1
% 3.34/1.91 #BackRed : 0
% 3.34/1.91
% 3.34/1.91 #Partial instantiations: 0
% 3.34/1.91 #Strategies tried : 1
% 3.34/1.91
% 3.34/1.91 Timing (in seconds)
% 3.34/1.91 ----------------------
% 3.34/1.91 Preprocessing : 0.44
% 3.34/1.91 Parsing : 0.25
% 3.34/1.91 CNF conversion : 0.03
% 3.34/1.91 Main loop : 0.39
% 3.34/1.91 Inferencing : 0.15
% 3.34/1.91 Reduction : 0.12
% 3.34/1.91 Demodulation : 0.10
% 3.34/1.91 BG Simplification : 0.02
% 3.34/1.91 Subsumption : 0.08
% 3.34/1.91 Abstraction : 0.02
% 3.34/1.91 MUC search : 0.00
% 3.34/1.91 Cooper : 0.00
% 3.34/1.91 Total : 0.88
% 3.34/1.91 Index Insertion : 0.00
% 3.34/1.91 Index Deletion : 0.00
% 3.34/1.91 Index Matching : 0.00
% 3.34/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------