TSTP Solution File: SEU166+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU166+3 : 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 : n021.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:52 EDT 2023
% Result : Theorem 14.57s 5.02s
% Output : CNFRefutation 14.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 56 ( 9 unt; 19 typ; 0 def)
% Number of atoms : 87 ( 4 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 95 ( 45 ~; 42 |; 3 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 14 >; 20 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 95 (; 93 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > unordered_pair > ordered_pair > cartesian_product2 > #nlpp > singleton > #skF_1 > #skF_11 > #skF_4 > #skF_10 > #skF_2 > #skF_6 > #skF_9 > #skF_8 > #skF_5 > #skF_3 > #skF_7 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_64,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_52,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_45,axiom,
! [A,B,C] :
( ( C = cartesian_product2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ? [E,F] :
( in(E,A)
& in(F,B)
& ( D = ordered_pair(E,F) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
tff(f_71,negated_conjecture,
~ ! [A,B,C] :
( subset(A,B)
=> ( subset(cartesian_product2(A,C),cartesian_product2(B,C))
& subset(cartesian_product2(C,A),cartesian_product2(C,B)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t118_zfmisc_1) ).
tff(c_44,plain,
! [A_48] : subset(A_48,A_48),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_34,plain,
! [A_39,B_40] :
( in('#skF_7'(A_39,B_40),A_39)
| subset(A_39,B_40) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_12,plain,
! [A_5,B_6,D_32] :
( in('#skF_5'(A_5,B_6,cartesian_product2(A_5,B_6),D_32),A_5)
| ~ in(D_32,cartesian_product2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_48,plain,
subset('#skF_10','#skF_11'),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_5620,plain,
! [A_435,B_436,D_437] :
( in('#skF_6'(A_435,B_436,cartesian_product2(A_435,B_436),D_437),B_436)
| ~ in(D_437,cartesian_product2(A_435,B_436)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_30,plain,
! [C_43,B_40,A_39] :
( in(C_43,B_40)
| ~ in(C_43,A_39)
| ~ subset(A_39,B_40) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_7905,plain,
! [A_602,B_603,D_604,B_605] :
( in('#skF_6'(A_602,B_603,cartesian_product2(A_602,B_603),D_604),B_605)
| ~ subset(B_603,B_605)
| ~ in(D_604,cartesian_product2(A_602,B_603)) ),
inference(resolution,[status(thm)],[c_5620,c_30]) ).
tff(c_16934,plain,
! [B_1001,D_1000,A_1002,B_999,B_1003] :
( in('#skF_6'(A_1002,B_1003,cartesian_product2(A_1002,B_1003),D_1000),B_1001)
| ~ subset(B_999,B_1001)
| ~ subset(B_1003,B_999)
| ~ in(D_1000,cartesian_product2(A_1002,B_1003)) ),
inference(resolution,[status(thm)],[c_7905,c_30]) ).
tff(c_16953,plain,
! [A_1004,B_1005,D_1006] :
( in('#skF_6'(A_1004,B_1005,cartesian_product2(A_1004,B_1005),D_1006),'#skF_11')
| ~ subset(B_1005,'#skF_10')
| ~ in(D_1006,cartesian_product2(A_1004,B_1005)) ),
inference(resolution,[status(thm)],[c_48,c_16934]) ).
tff(c_6007,plain,
! [A_470,B_471,D_472] :
( ( ordered_pair('#skF_5'(A_470,B_471,cartesian_product2(A_470,B_471),D_472),'#skF_6'(A_470,B_471,cartesian_product2(A_470,B_471),D_472)) = D_472 )
| ~ in(D_472,cartesian_product2(A_470,B_471)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_6,plain,
! [E_37,F_38,A_5,B_6] :
( in(ordered_pair(E_37,F_38),cartesian_product2(A_5,B_6))
| ~ in(F_38,B_6)
| ~ in(E_37,A_5) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_6028,plain,
! [A_470,B_6,B_471,A_5,D_472] :
( in(D_472,cartesian_product2(A_5,B_6))
| ~ in('#skF_6'(A_470,B_471,cartesian_product2(A_470,B_471),D_472),B_6)
| ~ in('#skF_5'(A_470,B_471,cartesian_product2(A_470,B_471),D_472),A_5)
| ~ in(D_472,cartesian_product2(A_470,B_471)) ),
inference(superposition,[status(thm),theory(equality)],[c_6007,c_6]) ).
tff(c_17620,plain,
! [D_1041,A_1042,A_1043,B_1044] :
( in(D_1041,cartesian_product2(A_1042,'#skF_11'))
| ~ in('#skF_5'(A_1043,B_1044,cartesian_product2(A_1043,B_1044),D_1041),A_1042)
| ~ subset(B_1044,'#skF_10')
| ~ in(D_1041,cartesian_product2(A_1043,B_1044)) ),
inference(resolution,[status(thm)],[c_16953,c_6028]) ).
tff(c_17647,plain,
! [D_1045,A_1046,B_1047] :
( in(D_1045,cartesian_product2(A_1046,'#skF_11'))
| ~ subset(B_1047,'#skF_10')
| ~ in(D_1045,cartesian_product2(A_1046,B_1047)) ),
inference(resolution,[status(thm)],[c_12,c_17620]) ).
tff(c_19167,plain,
! [A_1103,B_1104,B_1105] :
( in('#skF_7'(cartesian_product2(A_1103,B_1104),B_1105),cartesian_product2(A_1103,'#skF_11'))
| ~ subset(B_1104,'#skF_10')
| subset(cartesian_product2(A_1103,B_1104),B_1105) ),
inference(resolution,[status(thm)],[c_34,c_17647]) ).
tff(c_32,plain,
! [A_39,B_40] :
( ~ in('#skF_7'(A_39,B_40),B_40)
| subset(A_39,B_40) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_19300,plain,
! [B_1107,A_1108] :
( ~ subset(B_1107,'#skF_10')
| subset(cartesian_product2(A_1108,B_1107),cartesian_product2(A_1108,'#skF_11')) ),
inference(resolution,[status(thm)],[c_19167,c_32]) ).
tff(c_290,plain,
! [A_81,B_82,D_83] :
( in('#skF_5'(A_81,B_82,cartesian_product2(A_81,B_82),D_83),A_81)
| ~ in(D_83,cartesian_product2(A_81,B_82)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_295,plain,
! [A_81,B_82,D_83,B_40] :
( in('#skF_5'(A_81,B_82,cartesian_product2(A_81,B_82),D_83),B_40)
| ~ subset(A_81,B_40)
| ~ in(D_83,cartesian_product2(A_81,B_82)) ),
inference(resolution,[status(thm)],[c_290,c_30]) ).
tff(c_10,plain,
! [A_5,B_6,D_32] :
( in('#skF_6'(A_5,B_6,cartesian_product2(A_5,B_6),D_32),B_6)
| ~ in(D_32,cartesian_product2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_609,plain,
! [A_111,B_112,D_113] :
( ( ordered_pair('#skF_5'(A_111,B_112,cartesian_product2(A_111,B_112),D_113),'#skF_6'(A_111,B_112,cartesian_product2(A_111,B_112),D_113)) = D_113 )
| ~ in(D_113,cartesian_product2(A_111,B_112)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_4767,plain,
! [A_314,B_316,B_312,D_315,A_313] :
( in(D_315,cartesian_product2(A_313,B_312))
| ~ in('#skF_6'(A_314,B_316,cartesian_product2(A_314,B_316),D_315),B_312)
| ~ in('#skF_5'(A_314,B_316,cartesian_product2(A_314,B_316),D_315),A_313)
| ~ in(D_315,cartesian_product2(A_314,B_316)) ),
inference(superposition,[status(thm),theory(equality)],[c_609,c_6]) ).
tff(c_5236,plain,
! [D_392,A_393,B_394,A_395] :
( in(D_392,cartesian_product2(A_393,B_394))
| ~ in('#skF_5'(A_395,B_394,cartesian_product2(A_395,B_394),D_392),A_393)
| ~ in(D_392,cartesian_product2(A_395,B_394)) ),
inference(resolution,[status(thm)],[c_10,c_4767]) ).
tff(c_5245,plain,
! [D_396,B_397,B_398,A_399] :
( in(D_396,cartesian_product2(B_397,B_398))
| ~ subset(A_399,B_397)
| ~ in(D_396,cartesian_product2(A_399,B_398)) ),
inference(resolution,[status(thm)],[c_295,c_5236]) ).
tff(c_5255,plain,
! [D_400,B_401] :
( in(D_400,cartesian_product2('#skF_11',B_401))
| ~ in(D_400,cartesian_product2('#skF_10',B_401)) ),
inference(resolution,[status(thm)],[c_48,c_5245]) ).
tff(c_5414,plain,
! [A_416,B_417] :
( subset(A_416,cartesian_product2('#skF_11',B_417))
| ~ in('#skF_7'(A_416,cartesian_product2('#skF_11',B_417)),cartesian_product2('#skF_10',B_417)) ),
inference(resolution,[status(thm)],[c_5255,c_32]) ).
tff(c_5429,plain,
! [B_417] : subset(cartesian_product2('#skF_10',B_417),cartesian_product2('#skF_11',B_417)),
inference(resolution,[status(thm)],[c_34,c_5414]) ).
tff(c_46,plain,
( ~ subset(cartesian_product2('#skF_12','#skF_10'),cartesian_product2('#skF_12','#skF_11'))
| ~ subset(cartesian_product2('#skF_10','#skF_12'),cartesian_product2('#skF_11','#skF_12')) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_96,plain,
~ subset(cartesian_product2('#skF_10','#skF_12'),cartesian_product2('#skF_11','#skF_12')),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_5432,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5429,c_96]) ).
tff(c_5433,plain,
~ subset(cartesian_product2('#skF_12','#skF_10'),cartesian_product2('#skF_12','#skF_11')),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_19351,plain,
~ subset('#skF_10','#skF_10'),
inference(resolution,[status(thm)],[c_19300,c_5433]) ).
tff(c_19376,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_19351]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU166+3 : 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.13/0.35 % Computer : n021.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 11:58:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 14.57/5.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.57/5.03
% 14.57/5.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.57/5.06
% 14.57/5.06 Inference rules
% 14.57/5.06 ----------------------
% 14.57/5.06 #Ref : 6
% 14.57/5.06 #Sup : 5045
% 14.57/5.06 #Fact : 0
% 14.57/5.06 #Define : 0
% 14.57/5.06 #Split : 14
% 14.57/5.06 #Chain : 0
% 14.57/5.06 #Close : 0
% 14.57/5.06
% 14.57/5.06 Ordering : KBO
% 14.57/5.06
% 14.57/5.06 Simplification rules
% 14.57/5.06 ----------------------
% 14.57/5.06 #Subsume : 593
% 14.57/5.06 #Demod : 3472
% 14.57/5.06 #Tautology : 742
% 14.57/5.06 #SimpNegUnit : 0
% 14.57/5.06 #BackRed : 1
% 14.57/5.06
% 14.57/5.06 #Partial instantiations: 0
% 14.57/5.06 #Strategies tried : 1
% 14.57/5.06
% 14.57/5.06 Timing (in seconds)
% 14.57/5.06 ----------------------
% 14.57/5.07 Preprocessing : 0.50
% 14.57/5.07 Parsing : 0.26
% 14.57/5.07 CNF conversion : 0.04
% 14.57/5.07 Main loop : 3.49
% 14.57/5.07 Inferencing : 0.91
% 14.57/5.07 Reduction : 1.55
% 14.57/5.07 Demodulation : 1.25
% 14.57/5.07 BG Simplification : 0.12
% 14.57/5.07 Subsumption : 0.69
% 14.57/5.07 Abstraction : 0.24
% 14.57/5.07 MUC search : 0.00
% 14.57/5.07 Cooper : 0.00
% 14.57/5.07 Total : 4.04
% 14.57/5.07 Index Insertion : 0.00
% 14.57/5.07 Index Deletion : 0.00
% 14.57/5.07 Index Matching : 0.00
% 14.57/5.07 BG Taut test : 0.00
%------------------------------------------------------------------------------