TSTP Solution File: SEU177+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU177+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 : n014.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:55 EDT 2023
% Result : Theorem 3.89s 1.93s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 28
% Syntax : Number of formulae : 41 ( 8 unt; 25 typ; 0 def)
% Number of atoms : 32 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 7 |; 1 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 18 >; 14 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 7 con; 0-3 aty)
% Number of variables : 17 (; 15 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation > empty > unordered_pair > ordered_pair > #nlpp > singleton > relation_rng > relation_dom > empty_set > #skF_1 > #skF_7 > #skF_13 > #skF_14 > #skF_12 > #skF_5 > #skF_6 > #skF_2 > #skF_10 > #skF_3 > #skF_8 > #skF_11 > #skF_15 > #skF_4 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $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('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(f_94,negated_conjecture,
~ ! [A,B,C] :
( relation(C)
=> ( in(ordered_pair(A,B),C)
=> ( in(A,relation_dom(C))
& in(B,relation_rng(C)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_relat_1) ).
tff(f_105,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_dom(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(C,D),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
tff(f_116,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_rng(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
tff(c_50,plain,
( ~ in('#skF_6',relation_rng('#skF_7'))
| ~ in('#skF_5',relation_dom('#skF_7')) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_128,plain,
~ in('#skF_5',relation_dom('#skF_7')),
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_54,plain,
relation('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_52,plain,
in(ordered_pair('#skF_5','#skF_6'),'#skF_7'),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_277,plain,
! [C_129,A_130,D_131] :
( in(C_129,relation_dom(A_130))
| ~ in(ordered_pair(C_129,D_131),A_130)
| ~ relation(A_130) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_284,plain,
( in('#skF_5',relation_dom('#skF_7'))
| ~ relation('#skF_7') ),
inference(resolution,[status(thm)],[c_52,c_277]) ).
tff(c_288,plain,
in('#skF_5',relation_dom('#skF_7')),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_284]) ).
tff(c_290,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_128,c_288]) ).
tff(c_291,plain,
~ in('#skF_6',relation_rng('#skF_7')),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_431,plain,
! [C_146,A_147,D_148] :
( in(C_146,relation_rng(A_147))
| ~ in(ordered_pair(D_148,C_146),A_147)
| ~ relation(A_147) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_438,plain,
( in('#skF_6',relation_rng('#skF_7'))
| ~ relation('#skF_7') ),
inference(resolution,[status(thm)],[c_52,c_431]) ).
tff(c_442,plain,
in('#skF_6',relation_rng('#skF_7')),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_438]) ).
tff(c_444,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_291,c_442]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU177+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.15/0.34 % Computer : n014.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 11:35:18 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.89/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.89/1.94
% 3.89/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.89/1.96
% 3.89/1.96 Inference rules
% 3.89/1.96 ----------------------
% 3.89/1.96 #Ref : 0
% 3.89/1.96 #Sup : 91
% 3.89/1.96 #Fact : 0
% 3.89/1.96 #Define : 0
% 3.89/1.96 #Split : 4
% 3.89/1.96 #Chain : 0
% 3.89/1.96 #Close : 0
% 3.89/1.96
% 3.89/1.96 Ordering : KBO
% 3.89/1.96
% 3.89/1.96 Simplification rules
% 3.89/1.96 ----------------------
% 3.89/1.96 #Subsume : 12
% 3.89/1.96 #Demod : 11
% 3.89/1.96 #Tautology : 44
% 3.89/1.96 #SimpNegUnit : 6
% 3.89/1.96 #BackRed : 5
% 3.89/1.96
% 3.89/1.96 #Partial instantiations: 0
% 3.89/1.96 #Strategies tried : 1
% 3.89/1.96
% 3.89/1.96 Timing (in seconds)
% 3.89/1.96 ----------------------
% 3.89/1.96 Preprocessing : 0.52
% 3.89/1.96 Parsing : 0.27
% 3.89/1.96 CNF conversion : 0.05
% 3.89/1.96 Main loop : 0.34
% 3.89/1.96 Inferencing : 0.11
% 3.89/1.96 Reduction : 0.11
% 3.89/1.96 Demodulation : 0.08
% 3.89/1.96 BG Simplification : 0.02
% 3.89/1.96 Subsumption : 0.07
% 3.89/1.96 Abstraction : 0.02
% 3.89/1.96 MUC search : 0.00
% 3.89/1.96 Cooper : 0.00
% 3.89/1.96 Total : 0.91
% 3.89/1.96 Index Insertion : 0.00
% 3.89/1.96 Index Deletion : 0.00
% 3.89/1.96 Index Matching : 0.00
% 3.89/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------