TSTP Solution File: SEU041+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU041+1 : 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 : 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:31 EDT 2023
% Result : Theorem 4.75s 2.08s
% Output : CNFRefutation 4.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 28
% Syntax : Number of formulae : 39 ( 6 unt; 25 typ; 0 def)
% Number of atoms : 29 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 28 ( 13 ~; 7 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 13 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_dom_restriction > #nlpp > 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_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('#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('#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('#skF_8',type,
'#skF_8': $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_191,negated_conjecture,
~ ! [A,B,C] :
( ( relation(C)
& function(C) )
=> ( subset(A,B)
=> ( ( relation_dom_restriction(relation_dom_restriction(C,A),B) = relation_dom_restriction(C,A) )
& ( relation_dom_restriction(relation_dom_restriction(C,B),A) = relation_dom_restriction(C,A) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t82_funct_1) ).
tff(f_203,axiom,
! [A,B,C] :
( relation(C)
=> ( subset(A,B)
=> ( relation_dom_restriction(relation_dom_restriction(C,B),A) = relation_dom_restriction(C,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t103_relat_1) ).
tff(f_197,axiom,
! [A,B,C] :
( relation(C)
=> ( subset(A,B)
=> ( relation_dom_restriction(relation_dom_restriction(C,A),B) = relation_dom_restriction(C,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t102_relat_1) ).
tff(c_106,plain,
relation('#skF_14'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_102,plain,
subset('#skF_12','#skF_13'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_780,plain,
! [C_173,B_174,A_175] :
( ( relation_dom_restriction(relation_dom_restriction(C_173,B_174),A_175) = relation_dom_restriction(C_173,A_175) )
| ~ subset(A_175,B_174)
| ~ relation(C_173) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_435,plain,
! [C_112,A_113,B_114] :
( ( relation_dom_restriction(relation_dom_restriction(C_112,A_113),B_114) = relation_dom_restriction(C_112,A_113) )
| ~ subset(A_113,B_114)
| ~ relation(C_112) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_100,plain,
( ( relation_dom_restriction(relation_dom_restriction('#skF_14','#skF_13'),'#skF_12') != relation_dom_restriction('#skF_14','#skF_12') )
| ( relation_dom_restriction(relation_dom_restriction('#skF_14','#skF_12'),'#skF_13') != relation_dom_restriction('#skF_14','#skF_12') ) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_114,plain,
relation_dom_restriction(relation_dom_restriction('#skF_14','#skF_12'),'#skF_13') != relation_dom_restriction('#skF_14','#skF_12'),
inference(splitLeft,[status(thm)],[c_100]) ).
tff(c_459,plain,
( ~ subset('#skF_12','#skF_13')
| ~ relation('#skF_14') ),
inference(superposition,[status(thm),theory(equality)],[c_435,c_114]) ).
tff(c_477,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_102,c_459]) ).
tff(c_478,plain,
relation_dom_restriction(relation_dom_restriction('#skF_14','#skF_13'),'#skF_12') != relation_dom_restriction('#skF_14','#skF_12'),
inference(splitRight,[status(thm)],[c_100]) ).
tff(c_807,plain,
( ~ subset('#skF_12','#skF_13')
| ~ relation('#skF_14') ),
inference(superposition,[status(thm),theory(equality)],[c_780,c_478]) ).
tff(c_832,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_102,c_807]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU041+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/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.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 12:28:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 4.75/2.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.75/2.09
% 4.75/2.09 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.75/2.11
% 4.75/2.11 Inference rules
% 4.75/2.11 ----------------------
% 4.75/2.11 #Ref : 0
% 4.75/2.11 #Sup : 162
% 4.75/2.11 #Fact : 0
% 4.75/2.11 #Define : 0
% 4.75/2.11 #Split : 10
% 4.75/2.11 #Chain : 0
% 4.75/2.11 #Close : 0
% 4.75/2.11
% 4.75/2.11 Ordering : KBO
% 4.75/2.11
% 4.75/2.11 Simplification rules
% 4.75/2.11 ----------------------
% 4.75/2.11 #Subsume : 17
% 4.75/2.11 #Demod : 77
% 4.75/2.11 #Tautology : 83
% 4.75/2.11 #SimpNegUnit : 4
% 4.75/2.11 #BackRed : 24
% 4.75/2.11
% 4.75/2.11 #Partial instantiations: 0
% 4.75/2.11 #Strategies tried : 1
% 4.75/2.11
% 4.75/2.11 Timing (in seconds)
% 4.75/2.11 ----------------------
% 4.75/2.12 Preprocessing : 0.54
% 4.75/2.12 Parsing : 0.29
% 4.75/2.12 CNF conversion : 0.04
% 4.75/2.12 Main loop : 0.52
% 4.75/2.12 Inferencing : 0.20
% 4.75/2.12 Reduction : 0.15
% 4.75/2.12 Demodulation : 0.10
% 4.75/2.12 BG Simplification : 0.03
% 4.75/2.12 Subsumption : 0.10
% 4.75/2.12 Abstraction : 0.02
% 4.75/2.12 MUC search : 0.00
% 4.75/2.12 Cooper : 0.00
% 4.75/2.12 Total : 1.11
% 4.75/2.12 Index Insertion : 0.00
% 4.75/2.12 Index Deletion : 0.00
% 4.75/2.12 Index Matching : 0.00
% 4.75/2.12 BG Taut test : 0.00
%------------------------------------------------------------------------------