TSTP Solution File: SEU180+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU180+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 : n023.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:55 EDT 2023
% Result : Theorem 6.57s 2.64s
% Output : CNFRefutation 6.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 34
% Syntax : Number of formulae : 56 ( 9 unt; 29 typ; 0 def)
% Number of atoms : 57 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 22 ~; 18 |; 1 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 41 ( 22 >; 19 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 7 con; 0-3 aty)
% Number of variables : 34 (; 32 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation > empty > unordered_pair > set_union2 > ordered_pair > #nlpp > singleton > relation_rng > relation_field > relation_dom > empty_set > #skF_1 > #skF_17 > #skF_6 > #skF_15 > #skF_3 > #skF_16 > #skF_14 > #skF_13 > #skF_2 > #skF_8 > #skF_11 > #skF_7 > #skF_9 > #skF_5 > #skF_12 > #skF_4 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation_field,type,
relation_field: $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_136,negated_conjecture,
~ ! [A,B,C] :
( relation(C)
=> ( in(ordered_pair(A,B),C)
=> ( in(A,relation_field(C))
& in(B,relation_field(C)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_relat_1) ).
tff(f_55,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_dom(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(C,D),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
tff(f_72,axiom,
! [A] :
( relation(A)
=> ( relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_relat_1) ).
tff(f_44,axiom,
! [A,B,C] :
( ( C = set_union2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f_66,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_rng(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
tff(c_108,plain,
relation('#skF_17'),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_106,plain,
in(ordered_pair('#skF_15','#skF_16'),'#skF_17'),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_606,plain,
! [C_177,A_178,D_179] :
( in(C_177,relation_dom(A_178))
| ~ in(ordered_pair(C_177,D_179),A_178)
| ~ relation(A_178) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_621,plain,
( in('#skF_15',relation_dom('#skF_17'))
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_106,c_606]) ).
tff(c_627,plain,
in('#skF_15',relation_dom('#skF_17')),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_621]) ).
tff(c_496,plain,
! [A_167] :
( ( set_union2(relation_dom(A_167),relation_rng(A_167)) = relation_field(A_167) )
| ~ relation(A_167) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_12,plain,
! [D_12,A_7,B_8] :
( ~ in(D_12,A_7)
| in(D_12,set_union2(A_7,B_8)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_1768,plain,
! [D_258,A_259] :
( ~ in(D_258,relation_dom(A_259))
| in(D_258,relation_field(A_259))
| ~ relation(A_259) ),
inference(superposition,[status(thm),theory(equality)],[c_496,c_12]) ).
tff(c_104,plain,
( ~ in('#skF_16',relation_field('#skF_17'))
| ~ in('#skF_15',relation_field('#skF_17')) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_187,plain,
~ in('#skF_15',relation_field('#skF_17')),
inference(splitLeft,[status(thm)],[c_104]) ).
tff(c_1822,plain,
( ~ in('#skF_15',relation_dom('#skF_17'))
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_1768,c_187]) ).
tff(c_1847,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_627,c_1822]) ).
tff(c_1848,plain,
~ in('#skF_16',relation_field('#skF_17')),
inference(splitRight,[status(thm)],[c_104]) ).
tff(c_2453,plain,
! [C_320,A_321,D_322] :
( in(C_320,relation_rng(A_321))
| ~ in(ordered_pair(D_322,C_320),A_321)
| ~ relation(A_321) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_2468,plain,
( in('#skF_16',relation_rng('#skF_17'))
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_106,c_2453]) ).
tff(c_2474,plain,
in('#skF_16',relation_rng('#skF_17')),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_2468]) ).
tff(c_2280,plain,
! [A_304] :
( ( set_union2(relation_dom(A_304),relation_rng(A_304)) = relation_field(A_304) )
| ~ relation(A_304) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_10,plain,
! [D_12,B_8,A_7] :
( ~ in(D_12,B_8)
| in(D_12,set_union2(A_7,B_8)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_3384,plain,
! [D_383,A_384] :
( ~ in(D_383,relation_rng(A_384))
| in(D_383,relation_field(A_384))
| ~ relation(A_384) ),
inference(superposition,[status(thm),theory(equality)],[c_2280,c_10]) ).
tff(c_3414,plain,
( in('#skF_16',relation_field('#skF_17'))
| ~ relation('#skF_17') ),
inference(resolution,[status(thm)],[c_2474,c_3384]) ).
tff(c_3430,plain,
in('#skF_16',relation_field('#skF_17')),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_3414]) ).
tff(c_3432,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1848,c_3430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU180+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/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.35 % Computer : n023.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 11:56:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.57/2.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.57/2.65
% 6.57/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.65/2.68
% 6.65/2.68 Inference rules
% 6.65/2.68 ----------------------
% 6.65/2.68 #Ref : 0
% 6.65/2.68 #Sup : 772
% 6.65/2.68 #Fact : 0
% 6.65/2.68 #Define : 0
% 6.65/2.68 #Split : 14
% 6.65/2.68 #Chain : 0
% 6.65/2.68 #Close : 0
% 6.65/2.68
% 6.65/2.68 Ordering : KBO
% 6.65/2.68
% 6.65/2.68 Simplification rules
% 6.65/2.68 ----------------------
% 6.65/2.68 #Subsume : 166
% 6.65/2.68 #Demod : 235
% 6.65/2.68 #Tautology : 227
% 6.65/2.68 #SimpNegUnit : 26
% 6.65/2.68 #BackRed : 13
% 6.65/2.68
% 6.65/2.68 #Partial instantiations: 0
% 6.65/2.68 #Strategies tried : 1
% 6.65/2.68
% 6.65/2.68 Timing (in seconds)
% 6.65/2.68 ----------------------
% 6.65/2.68 Preprocessing : 0.59
% 6.65/2.68 Parsing : 0.30
% 6.65/2.68 CNF conversion : 0.06
% 6.65/2.68 Main loop : 1.00
% 6.65/2.69 Inferencing : 0.36
% 6.65/2.69 Reduction : 0.32
% 6.65/2.69 Demodulation : 0.23
% 6.65/2.69 BG Simplification : 0.04
% 6.65/2.69 Subsumption : 0.20
% 6.65/2.69 Abstraction : 0.04
% 6.65/2.69 MUC search : 0.00
% 6.65/2.69 Cooper : 0.00
% 6.65/2.69 Total : 1.65
% 6.65/2.69 Index Insertion : 0.00
% 6.65/2.69 Index Deletion : 0.00
% 6.65/2.69 Index Matching : 0.00
% 6.65/2.69 BG Taut test : 0.00
%------------------------------------------------------------------------------