TSTP Solution File: SEU223+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU223+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 : 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:58:04 EDT 2023
% Result : Theorem 4.77s 2.17s
% Output : CNFRefutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 33
% Syntax : Number of formulae : 49 ( 9 unt; 29 typ; 0 def)
% Number of atoms : 50 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 16 |; 6 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 17 >; 8 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-3 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > set_intersection2 > relation_dom_restriction > apply > #nlpp > relation_dom > powerset > empty_set > #skF_5 > #skF_11 > #skF_1 > #skF_7 > #skF_10 > #skF_14 > #skF_13 > #skF_2 > #skF_3 > #skF_9 > #skF_8 > #skF_15 > #skF_4 > #skF_6 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $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(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(relation_dom_restriction,type,
relation_dom_restriction: ( $i * $i ) > $i ).
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_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_215,negated_conjecture,
~ ! [A,B,C] :
( ( relation(C)
& function(C) )
=> ( in(B,relation_dom(relation_dom_restriction(C,A)))
=> ( apply(relation_dom_restriction(C,A),B) = apply(C,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t70_funct_1) ).
tff(f_143,axiom,
! [A,B] :
( ( relation(A)
& function(A) )
=> ( relation(relation_dom_restriction(A,B))
& function(relation_dom_restriction(A,B)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_funct_1) ).
tff(f_135,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
tff(f_233,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ! [C] :
( ( relation(C)
& function(C) )
=> ( ( B = relation_dom_restriction(C,A) )
<=> ( ( relation_dom(B) = set_intersection2(relation_dom(C),A) )
& ! [D] :
( in(D,relation_dom(B))
=> ( apply(B,D) = apply(C,D) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t68_funct_1) ).
tff(c_120,plain,
relation('#skF_14'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_118,plain,
function('#skF_14'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_64,plain,
! [A_35,B_36] :
( function(relation_dom_restriction(A_35,B_36))
| ~ function(A_35)
| ~ relation(A_35) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_62,plain,
! [A_33,B_34] :
( relation(relation_dom_restriction(A_33,B_34))
| ~ relation(A_33) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_114,plain,
apply(relation_dom_restriction('#skF_14','#skF_12'),'#skF_13') != apply('#skF_14','#skF_13'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_116,plain,
in('#skF_13',relation_dom(relation_dom_restriction('#skF_14','#skF_12'))),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_745,plain,
! [C_149,A_150,D_151] :
( ( apply(relation_dom_restriction(C_149,A_150),D_151) = apply(C_149,D_151) )
| ~ in(D_151,relation_dom(relation_dom_restriction(C_149,A_150)))
| ~ function(C_149)
| ~ relation(C_149)
| ~ function(relation_dom_restriction(C_149,A_150))
| ~ relation(relation_dom_restriction(C_149,A_150)) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_756,plain,
( ( apply(relation_dom_restriction('#skF_14','#skF_12'),'#skF_13') = apply('#skF_14','#skF_13') )
| ~ function('#skF_14')
| ~ relation('#skF_14')
| ~ function(relation_dom_restriction('#skF_14','#skF_12'))
| ~ relation(relation_dom_restriction('#skF_14','#skF_12')) ),
inference(resolution,[status(thm)],[c_116,c_745]) ).
tff(c_761,plain,
( ( apply(relation_dom_restriction('#skF_14','#skF_12'),'#skF_13') = apply('#skF_14','#skF_13') )
| ~ function(relation_dom_restriction('#skF_14','#skF_12'))
| ~ relation(relation_dom_restriction('#skF_14','#skF_12')) ),
inference(demodulation,[status(thm),theory(equality)],[c_120,c_118,c_756]) ).
tff(c_762,plain,
( ~ function(relation_dom_restriction('#skF_14','#skF_12'))
| ~ relation(relation_dom_restriction('#skF_14','#skF_12')) ),
inference(negUnitSimplification,[status(thm)],[c_114,c_761]) ).
tff(c_763,plain,
~ relation(relation_dom_restriction('#skF_14','#skF_12')),
inference(splitLeft,[status(thm)],[c_762]) ).
tff(c_766,plain,
~ relation('#skF_14'),
inference(resolution,[status(thm)],[c_62,c_763]) ).
tff(c_773,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_120,c_766]) ).
tff(c_774,plain,
~ function(relation_dom_restriction('#skF_14','#skF_12')),
inference(splitRight,[status(thm)],[c_762]) ).
tff(c_778,plain,
( ~ function('#skF_14')
| ~ relation('#skF_14') ),
inference(resolution,[status(thm)],[c_64,c_774]) ).
tff(c_785,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_120,c_118,c_778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.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.35 % Computer : n016.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:19:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.77/2.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.77/2.17
% 4.77/2.17 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.77/2.20
% 4.77/2.20 Inference rules
% 4.77/2.20 ----------------------
% 4.77/2.20 #Ref : 0
% 4.77/2.20 #Sup : 142
% 4.77/2.20 #Fact : 0
% 4.77/2.20 #Define : 0
% 4.77/2.20 #Split : 5
% 4.77/2.20 #Chain : 0
% 4.77/2.20 #Close : 0
% 4.77/2.20
% 4.77/2.20 Ordering : KBO
% 4.77/2.20
% 4.77/2.20 Simplification rules
% 4.77/2.20 ----------------------
% 4.77/2.20 #Subsume : 16
% 4.77/2.20 #Demod : 72
% 4.77/2.20 #Tautology : 76
% 4.77/2.20 #SimpNegUnit : 8
% 4.77/2.20 #BackRed : 12
% 4.77/2.20
% 4.77/2.20 #Partial instantiations: 0
% 4.77/2.20 #Strategies tried : 1
% 4.77/2.20
% 4.77/2.20 Timing (in seconds)
% 4.77/2.20 ----------------------
% 4.77/2.20 Preprocessing : 0.64
% 4.77/2.20 Parsing : 0.32
% 4.77/2.20 CNF conversion : 0.05
% 4.77/2.20 Main loop : 0.50
% 4.77/2.20 Inferencing : 0.17
% 4.77/2.20 Reduction : 0.16
% 4.77/2.20 Demodulation : 0.11
% 4.77/2.20 BG Simplification : 0.03
% 4.77/2.20 Subsumption : 0.10
% 4.77/2.20 Abstraction : 0.02
% 4.77/2.20 MUC search : 0.00
% 4.77/2.20 Cooper : 0.00
% 4.77/2.20 Total : 1.19
% 4.77/2.20 Index Insertion : 0.00
% 4.77/2.20 Index Deletion : 0.00
% 4.77/2.20 Index Matching : 0.00
% 4.77/2.20 BG Taut test : 0.00
%------------------------------------------------------------------------------