TSTP Solution File: SEU223+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU223+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 : n027.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.76s 2.10s
% Output : CNFRefutation 4.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 29
% Syntax : Number of formulae : 45 ( 9 unt; 25 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 : 20 ( 13 >; 7 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 12 con; 0-3 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation_empty_yielding > relation > one_to_one > function > empty > set_intersection2 > relation_dom_restriction > apply > #nlpp > relation_dom > empty_set > #skF_13 > #skF_11 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_1 > #skF_9 > #skF_8 > #skF_4 > #skF_3 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(apply,type,
apply: ( $i * $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_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $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_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_180,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_156,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_144,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
tff(f_198,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_110,plain,
relation('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_108,plain,
function('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_94,plain,
! [A_24,B_25] :
( function(relation_dom_restriction(A_24,B_25))
| ~ function(A_24)
| ~ relation(A_24) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_88,plain,
! [A_22,B_23] :
( relation(relation_dom_restriction(A_22,B_23))
| ~ relation(A_22) ),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_104,plain,
apply(relation_dom_restriction('#skF_12','#skF_10'),'#skF_11') != apply('#skF_12','#skF_11'),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_106,plain,
in('#skF_11',relation_dom(relation_dom_restriction('#skF_12','#skF_10'))),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_754,plain,
! [C_98,A_99,D_100] :
( ( apply(relation_dom_restriction(C_98,A_99),D_100) = apply(C_98,D_100) )
| ~ in(D_100,relation_dom(relation_dom_restriction(C_98,A_99)))
| ~ function(C_98)
| ~ relation(C_98)
| ~ function(relation_dom_restriction(C_98,A_99))
| ~ relation(relation_dom_restriction(C_98,A_99)) ),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_765,plain,
( ( apply(relation_dom_restriction('#skF_12','#skF_10'),'#skF_11') = apply('#skF_12','#skF_11') )
| ~ function('#skF_12')
| ~ relation('#skF_12')
| ~ function(relation_dom_restriction('#skF_12','#skF_10'))
| ~ relation(relation_dom_restriction('#skF_12','#skF_10')) ),
inference(resolution,[status(thm)],[c_106,c_754]) ).
tff(c_770,plain,
( ( apply(relation_dom_restriction('#skF_12','#skF_10'),'#skF_11') = apply('#skF_12','#skF_11') )
| ~ function(relation_dom_restriction('#skF_12','#skF_10'))
| ~ relation(relation_dom_restriction('#skF_12','#skF_10')) ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_108,c_765]) ).
tff(c_771,plain,
( ~ function(relation_dom_restriction('#skF_12','#skF_10'))
| ~ relation(relation_dom_restriction('#skF_12','#skF_10')) ),
inference(negUnitSimplification,[status(thm)],[c_104,c_770]) ).
tff(c_878,plain,
~ relation(relation_dom_restriction('#skF_12','#skF_10')),
inference(splitLeft,[status(thm)],[c_771]) ).
tff(c_881,plain,
~ relation('#skF_12'),
inference(resolution,[status(thm)],[c_88,c_878]) ).
tff(c_888,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_110,c_881]) ).
tff(c_889,plain,
~ function(relation_dom_restriction('#skF_12','#skF_10')),
inference(splitRight,[status(thm)],[c_771]) ).
tff(c_893,plain,
( ~ function('#skF_12')
| ~ relation('#skF_12') ),
inference(resolution,[status(thm)],[c_94,c_889]) ).
tff(c_900,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_110,c_108,c_893]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU223+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 : n027.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 12:05:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.76/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.76/2.10
% 4.76/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.76/2.13
% 4.76/2.13 Inference rules
% 4.76/2.13 ----------------------
% 4.76/2.13 #Ref : 0
% 4.76/2.13 #Sup : 191
% 4.76/2.13 #Fact : 0
% 4.76/2.13 #Define : 0
% 4.76/2.13 #Split : 6
% 4.76/2.13 #Chain : 0
% 4.76/2.13 #Close : 0
% 4.76/2.13
% 4.76/2.13 Ordering : KBO
% 4.76/2.13
% 4.76/2.13 Simplification rules
% 4.76/2.13 ----------------------
% 4.76/2.13 #Subsume : 49
% 4.76/2.13 #Demod : 99
% 4.76/2.13 #Tautology : 92
% 4.76/2.13 #SimpNegUnit : 2
% 4.76/2.13 #BackRed : 10
% 4.76/2.13
% 4.76/2.13 #Partial instantiations: 0
% 4.76/2.13 #Strategies tried : 1
% 4.76/2.13
% 4.76/2.13 Timing (in seconds)
% 4.76/2.13 ----------------------
% 4.76/2.13 Preprocessing : 0.59
% 4.76/2.13 Parsing : 0.30
% 4.76/2.13 CNF conversion : 0.05
% 4.76/2.13 Main loop : 0.49
% 4.76/2.13 Inferencing : 0.16
% 4.76/2.13 Reduction : 0.15
% 4.76/2.13 Demodulation : 0.11
% 4.76/2.13 BG Simplification : 0.03
% 4.76/2.13 Subsumption : 0.11
% 4.76/2.13 Abstraction : 0.02
% 4.76/2.13 MUC search : 0.00
% 4.76/2.13 Cooper : 0.00
% 4.76/2.13 Total : 1.12
% 4.76/2.13 Index Insertion : 0.00
% 4.76/2.13 Index Deletion : 0.00
% 4.76/2.13 Index Matching : 0.00
% 4.76/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------