TSTP Solution File: SEU128+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU128+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/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 : 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:41 EDT 2023
% Result : Theorem 13.52s 4.67s
% Output : CNFRefutation 13.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 39 ( 10 unt; 13 typ; 0 def)
% Number of atoms : 56 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 22 ~; 23 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 48 (; 48 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_intersection2 > #nlpp > empty_set > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_8 > #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_8',type,
'#skF_8': $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_60,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_67,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(A,C) )
=> subset(A,set_intersection2(B,C)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
tff(f_40,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(c_42,plain,
! [A_18] : subset(A_18,A_18),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_intersection2(B_4,A_3) = set_intersection2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_48,plain,
subset('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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_292,plain,
! [C_55,B_56,A_57] :
( in(C_55,B_56)
| ~ in(C_55,A_57)
| ~ subset(A_57,B_56) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_450,plain,
! [A_74,B_75,B_76] :
( in('#skF_1'(A_74,B_75),B_76)
| ~ subset(A_74,B_76)
| subset(A_74,B_75) ),
inference(resolution,[status(thm)],[c_10,c_292]) ).
tff(c_6,plain,
! [C_9,B_6,A_5] :
( in(C_9,B_6)
| ~ in(C_9,A_5)
| ~ subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_17243,plain,
! [A_521,B_522,B_523,B_524] :
( in('#skF_1'(A_521,B_522),B_523)
| ~ subset(B_524,B_523)
| ~ subset(A_521,B_524)
| subset(A_521,B_522) ),
inference(resolution,[status(thm)],[c_450,c_6]) ).
tff(c_17302,plain,
! [A_521,B_522] :
( in('#skF_1'(A_521,B_522),'#skF_7')
| ~ subset(A_521,'#skF_6')
| subset(A_521,B_522) ),
inference(resolution,[status(thm)],[c_48,c_17243]) ).
tff(c_46,plain,
subset('#skF_6','#skF_8'),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_17304,plain,
! [A_525,B_526] :
( in('#skF_1'(A_525,B_526),'#skF_8')
| ~ subset(A_525,'#skF_6')
| subset(A_525,B_526) ),
inference(resolution,[status(thm)],[c_46,c_17243]) ).
tff(c_335,plain,
! [D_63,A_64,B_65] :
( in(D_63,set_intersection2(A_64,B_65))
| ~ in(D_63,B_65)
| ~ in(D_63,A_64) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
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_369,plain,
! [A_5,A_64,B_65] :
( subset(A_5,set_intersection2(A_64,B_65))
| ~ in('#skF_1'(A_5,set_intersection2(A_64,B_65)),B_65)
| ~ in('#skF_1'(A_5,set_intersection2(A_64,B_65)),A_64) ),
inference(resolution,[status(thm)],[c_335,c_8]) ).
tff(c_26918,plain,
! [A_618,A_619] :
( ~ in('#skF_1'(A_618,set_intersection2(A_619,'#skF_8')),A_619)
| ~ subset(A_618,'#skF_6')
| subset(A_618,set_intersection2(A_619,'#skF_8')) ),
inference(resolution,[status(thm)],[c_17304,c_369]) ).
tff(c_26950,plain,
! [A_521] :
( ~ subset(A_521,'#skF_6')
| subset(A_521,set_intersection2('#skF_7','#skF_8')) ),
inference(resolution,[status(thm)],[c_17302,c_26918]) ).
tff(c_27065,plain,
! [A_620] :
( ~ subset(A_620,'#skF_6')
| subset(A_620,set_intersection2('#skF_8','#skF_7')) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_26950]) ).
tff(c_44,plain,
~ subset('#skF_6',set_intersection2('#skF_7','#skF_8')),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_57,plain,
~ subset('#skF_6',set_intersection2('#skF_8','#skF_7')),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_44]) ).
tff(c_27097,plain,
~ subset('#skF_6','#skF_6'),
inference(resolution,[status(thm)],[c_27065,c_57]) ).
tff(c_27114,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_27097]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU128+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/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.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 12:25:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 13.52/4.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.52/4.68
% 13.52/4.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.52/4.71
% 13.52/4.71 Inference rules
% 13.52/4.71 ----------------------
% 13.52/4.71 #Ref : 0
% 13.52/4.71 #Sup : 7797
% 13.52/4.71 #Fact : 0
% 13.52/4.71 #Define : 0
% 13.52/4.71 #Split : 3
% 13.52/4.71 #Chain : 0
% 13.52/4.71 #Close : 0
% 13.52/4.71
% 13.52/4.71 Ordering : KBO
% 13.52/4.71
% 13.52/4.71 Simplification rules
% 13.52/4.71 ----------------------
% 13.52/4.71 #Subsume : 4111
% 13.52/4.71 #Demod : 2117
% 13.52/4.71 #Tautology : 1032
% 13.52/4.71 #SimpNegUnit : 1
% 13.52/4.71 #BackRed : 4
% 13.52/4.71
% 13.52/4.71 #Partial instantiations: 0
% 13.52/4.71 #Strategies tried : 1
% 13.52/4.71
% 13.52/4.71 Timing (in seconds)
% 13.52/4.71 ----------------------
% 13.52/4.71 Preprocessing : 0.49
% 13.52/4.71 Parsing : 0.25
% 13.52/4.71 CNF conversion : 0.04
% 13.52/4.71 Main loop : 3.15
% 13.52/4.71 Inferencing : 0.78
% 13.52/4.71 Reduction : 0.97
% 13.52/4.71 Demodulation : 0.77
% 13.52/4.71 BG Simplification : 0.08
% 13.52/4.71 Subsumption : 1.13
% 13.52/4.71 Abstraction : 0.08
% 13.52/4.71 MUC search : 0.00
% 13.52/4.71 Cooper : 0.00
% 13.52/4.71 Total : 3.69
% 13.52/4.71 Index Insertion : 0.00
% 13.52/4.71 Index Deletion : 0.00
% 13.52/4.71 Index Matching : 0.00
% 13.52/4.71 BG Taut test : 0.00
%------------------------------------------------------------------------------