TSTP Solution File: SEU250+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU250+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 : n028.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:58:10 EDT 2023
% Result : Theorem 6.45s 2.54s
% Output : CNFRefutation 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 28
% Syntax : Number of formulae : 44 ( 7 unt; 25 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 13 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 17 >; 8 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-2 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > one_to_one > function > empty > set_union2 > set_intersection2 > relation_restriction > cartesian_product2 > #nlpp > relation_rng > relation_field > relation_dom > powerset > empty_set > #skF_2 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation_field,type,
relation_field: $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
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_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(relation_restriction,type,
relation_restriction: ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_136,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> ( subset(relation_field(relation_restriction(B,A)),relation_field(B))
& subset(relation_field(relation_restriction(B,A)),A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_wellord1) ).
tff(f_58,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_123,axiom,
! [A,B,C] :
( relation(C)
=> ( in(A,relation_field(relation_restriction(C,B)))
=> ( in(A,relation_field(C))
& in(A,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_wellord1) ).
tff(c_90,plain,
relation('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_20,plain,
! [A_9,B_10] :
( in('#skF_1'(A_9,B_10),A_9)
| subset(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_3367,plain,
! [A_333,B_334,C_335] :
( in(A_333,B_334)
| ~ in(A_333,relation_field(relation_restriction(C_335,B_334)))
| ~ relation(C_335) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_4414,plain,
! [C_405,B_406,B_407] :
( in('#skF_1'(relation_field(relation_restriction(C_405,B_406)),B_407),B_406)
| ~ relation(C_405)
| subset(relation_field(relation_restriction(C_405,B_406)),B_407) ),
inference(resolution,[status(thm)],[c_20,c_3367]) ).
tff(c_18,plain,
! [A_9,B_10] :
( ~ in('#skF_1'(A_9,B_10),B_10)
| subset(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4479,plain,
! [C_408,B_409] :
( ~ relation(C_408)
| subset(relation_field(relation_restriction(C_408,B_409)),B_409) ),
inference(resolution,[status(thm)],[c_4414,c_18]) ).
tff(c_783,plain,
! [A_141,C_142,B_143] :
( in(A_141,relation_field(C_142))
| ~ in(A_141,relation_field(relation_restriction(C_142,B_143)))
| ~ relation(C_142) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_2434,plain,
! [C_241,B_242,B_243] :
( in('#skF_1'(relation_field(relation_restriction(C_241,B_242)),B_243),relation_field(C_241))
| ~ relation(C_241)
| subset(relation_field(relation_restriction(C_241,B_242)),B_243) ),
inference(resolution,[status(thm)],[c_20,c_783]) ).
tff(c_2672,plain,
! [C_247,B_248] :
( ~ relation(C_247)
| subset(relation_field(relation_restriction(C_247,B_248)),relation_field(C_247)) ),
inference(resolution,[status(thm)],[c_2434,c_18]) ).
tff(c_88,plain,
( ~ subset(relation_field(relation_restriction('#skF_9','#skF_8')),'#skF_8')
| ~ subset(relation_field(relation_restriction('#skF_9','#skF_8')),relation_field('#skF_9')) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_109,plain,
~ subset(relation_field(relation_restriction('#skF_9','#skF_8')),relation_field('#skF_9')),
inference(splitLeft,[status(thm)],[c_88]) ).
tff(c_2685,plain,
~ relation('#skF_9'),
inference(resolution,[status(thm)],[c_2672,c_109]) ).
tff(c_2700,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_90,c_2685]) ).
tff(c_2701,plain,
~ subset(relation_field(relation_restriction('#skF_9','#skF_8')),'#skF_8'),
inference(splitRight,[status(thm)],[c_88]) ).
tff(c_4499,plain,
~ relation('#skF_9'),
inference(resolution,[status(thm)],[c_4479,c_2701]) ).
tff(c_4513,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_90,c_4499]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU250+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.13/0.35 % Computer : n028.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 12:26:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.45/2.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.45/2.54
% 6.45/2.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.45/2.57
% 6.45/2.57 Inference rules
% 6.45/2.57 ----------------------
% 6.45/2.57 #Ref : 0
% 6.45/2.57 #Sup : 1035
% 6.45/2.57 #Fact : 0
% 6.45/2.57 #Define : 0
% 6.45/2.57 #Split : 18
% 6.45/2.57 #Chain : 0
% 6.45/2.57 #Close : 0
% 6.45/2.57
% 6.45/2.57 Ordering : KBO
% 6.45/2.57
% 6.45/2.57 Simplification rules
% 6.45/2.57 ----------------------
% 6.45/2.57 #Subsume : 463
% 6.45/2.57 #Demod : 415
% 6.45/2.57 #Tautology : 367
% 6.45/2.57 #SimpNegUnit : 83
% 6.45/2.57 #BackRed : 67
% 6.45/2.57
% 6.45/2.57 #Partial instantiations: 0
% 6.45/2.57 #Strategies tried : 1
% 6.45/2.57
% 6.45/2.57 Timing (in seconds)
% 6.45/2.57 ----------------------
% 6.45/2.57 Preprocessing : 0.52
% 6.45/2.57 Parsing : 0.28
% 6.45/2.57 CNF conversion : 0.04
% 6.45/2.57 Main loop : 0.94
% 6.45/2.57 Inferencing : 0.34
% 6.45/2.57 Reduction : 0.29
% 6.45/2.57 Demodulation : 0.21
% 6.45/2.57 BG Simplification : 0.03
% 6.45/2.57 Subsumption : 0.20
% 6.45/2.57 Abstraction : 0.03
% 6.45/2.57 MUC search : 0.00
% 6.45/2.57 Cooper : 0.00
% 6.45/2.57 Total : 1.50
% 6.45/2.57 Index Insertion : 0.00
% 6.45/2.57 Index Deletion : 0.00
% 6.45/2.57 Index Matching : 0.00
% 6.45/2.57 BG Taut test : 0.00
%------------------------------------------------------------------------------