TSTP Solution File: SEU198+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU198+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 : n004.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:59 EDT 2023
% Result : Theorem 4.43s 2.19s
% Output : CNFRefutation 4.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 31 ( 4 unt; 19 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 21 ( 8 ~; 7 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 12 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > empty > relation_rng_restriction > #nlpp > relation_rng > powerset > empty_set > #skF_7 > #skF_2 > #skF_4 > #skF_10 > #skF_5 > #skF_6 > #skF_3 > #skF_9 > #skF_8 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(relation_rng_restriction,type,
relation_rng_restriction: ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $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('#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('#skF_8',type,
'#skF_8': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_114,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> subset(relation_rng(relation_rng_restriction(A,B)),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t116_relat_1) ).
tff(f_42,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_109,axiom,
! [A,B,C] :
( relation(C)
=> ( in(A,relation_rng(relation_rng_restriction(B,C)))
<=> ( in(A,B)
& in(A,relation_rng(C)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_relat_1) ).
tff(c_68,plain,
relation('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_10,plain,
! [A_4,B_5] :
( in('#skF_1'(A_4,B_5),A_4)
| subset(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_502,plain,
! [A_127,B_128,C_129] :
( in(A_127,B_128)
| ~ in(A_127,relation_rng(relation_rng_restriction(B_128,C_129)))
| ~ relation(C_129) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_1528,plain,
! [B_211,C_212,B_213] :
( in('#skF_1'(relation_rng(relation_rng_restriction(B_211,C_212)),B_213),B_211)
| ~ relation(C_212)
| subset(relation_rng(relation_rng_restriction(B_211,C_212)),B_213) ),
inference(resolution,[status(thm)],[c_10,c_502]) ).
tff(c_8,plain,
! [A_4,B_5] :
( ~ in('#skF_1'(A_4,B_5),B_5)
| subset(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1606,plain,
! [C_216,B_217] :
( ~ relation(C_216)
| subset(relation_rng(relation_rng_restriction(B_217,C_216)),B_217) ),
inference(resolution,[status(thm)],[c_1528,c_8]) ).
tff(c_66,plain,
~ subset(relation_rng(relation_rng_restriction('#skF_9','#skF_10')),'#skF_9'),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_1627,plain,
~ relation('#skF_10'),
inference(resolution,[status(thm)],[c_1606,c_66]) ).
tff(c_1638,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_1627]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU198+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 11:50:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.43/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.43/2.20
% 4.43/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.43/2.22
% 4.43/2.22 Inference rules
% 4.43/2.22 ----------------------
% 4.43/2.22 #Ref : 0
% 4.43/2.22 #Sup : 357
% 4.43/2.22 #Fact : 0
% 4.43/2.22 #Define : 0
% 4.43/2.22 #Split : 6
% 4.43/2.22 #Chain : 0
% 4.43/2.22 #Close : 0
% 4.43/2.22
% 4.43/2.22 Ordering : KBO
% 4.43/2.22
% 4.43/2.22 Simplification rules
% 4.43/2.22 ----------------------
% 4.43/2.22 #Subsume : 90
% 4.43/2.22 #Demod : 112
% 4.43/2.22 #Tautology : 95
% 4.43/2.22 #SimpNegUnit : 12
% 4.43/2.22 #BackRed : 11
% 4.43/2.22
% 4.43/2.22 #Partial instantiations: 0
% 4.43/2.22 #Strategies tried : 1
% 4.43/2.22
% 4.43/2.22 Timing (in seconds)
% 4.43/2.22 ----------------------
% 4.43/2.23 Preprocessing : 0.51
% 4.43/2.23 Parsing : 0.28
% 4.43/2.23 CNF conversion : 0.04
% 4.43/2.23 Main loop : 0.65
% 4.43/2.23 Inferencing : 0.25
% 4.43/2.23 Reduction : 0.17
% 4.43/2.23 Demodulation : 0.11
% 4.43/2.23 BG Simplification : 0.03
% 4.43/2.23 Subsumption : 0.15
% 4.43/2.23 Abstraction : 0.02
% 4.43/2.23 MUC search : 0.00
% 4.43/2.23 Cooper : 0.00
% 4.43/2.23 Total : 1.21
% 4.43/2.23 Index Insertion : 0.00
% 4.43/2.23 Index Deletion : 0.00
% 4.43/2.23 Index Matching : 0.00
% 4.43/2.23 BG Taut test : 0.00
%------------------------------------------------------------------------------