TSTP Solution File: SEU127+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU127+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 : n027.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:40 EDT 2023
% Result : Theorem 3.90s 1.90s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 22 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 19 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 4 ~; 4 |; 1 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_intersection2 > #nlpp > empty_set > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_4 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
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(f_49,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(f_63,negated_conjecture,
~ ! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
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_259,plain,
! [D_50,A_51,B_52] :
( in(D_50,A_51)
| ~ in(D_50,set_intersection2(A_51,B_52)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_757,plain,
! [A_112,B_113,B_114] :
( in('#skF_1'(set_intersection2(A_112,B_113),B_114),A_112)
| subset(set_intersection2(A_112,B_113),B_114) ),
inference(resolution,[status(thm)],[c_10,c_259]) ).
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_806,plain,
! [A_112,B_113] : subset(set_intersection2(A_112,B_113),A_112),
inference(resolution,[status(thm)],[c_757,c_8]) ).
tff(c_44,plain,
~ subset(set_intersection2('#skF_6','#skF_7'),'#skF_6'),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_818,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_806,c_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % 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.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 12:06:38 EDT 2023
% 0.12/0.33 % CPUTime :
% 3.90/1.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.90/1.90
% 3.90/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.07/1.93
% 4.07/1.93 Inference rules
% 4.07/1.93 ----------------------
% 4.07/1.93 #Ref : 0
% 4.07/1.93 #Sup : 176
% 4.07/1.93 #Fact : 0
% 4.07/1.93 #Define : 0
% 4.07/1.93 #Split : 0
% 4.07/1.93 #Chain : 0
% 4.07/1.93 #Close : 0
% 4.07/1.93
% 4.07/1.93 Ordering : KBO
% 4.07/1.93
% 4.07/1.93 Simplification rules
% 4.07/1.93 ----------------------
% 4.07/1.93 #Subsume : 32
% 4.07/1.93 #Demod : 46
% 4.07/1.93 #Tautology : 65
% 4.07/1.93 #SimpNegUnit : 0
% 4.07/1.93 #BackRed : 4
% 4.07/1.93
% 4.07/1.93 #Partial instantiations: 0
% 4.07/1.93 #Strategies tried : 1
% 4.07/1.93
% 4.07/1.93 Timing (in seconds)
% 4.07/1.93 ----------------------
% 4.07/1.93 Preprocessing : 0.49
% 4.07/1.93 Parsing : 0.26
% 4.07/1.93 CNF conversion : 0.04
% 4.07/1.93 Main loop : 0.46
% 4.07/1.93 Inferencing : 0.17
% 4.07/1.93 Reduction : 0.14
% 4.07/1.93 Demodulation : 0.11
% 4.07/1.93 BG Simplification : 0.02
% 4.07/1.93 Subsumption : 0.10
% 4.07/1.93 Abstraction : 0.02
% 4.07/1.93 MUC search : 0.00
% 4.07/1.93 Cooper : 0.00
% 4.07/1.93 Total : 1.00
% 4.07/1.93 Index Insertion : 0.00
% 4.07/1.93 Index Deletion : 0.00
% 4.07/1.93 Index Matching : 0.00
% 4.07/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------