TSTP Solution File: SWV366+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV366+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n028.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 11:03:55 EDT 2023
% Result : Theorem 4.08s 1.98s
% Output : CNFRefutation 4.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 58
% Syntax : Number of formulae : 64 ( 7 unt; 56 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 37 ( 37 usr; 11 con; 0-3 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_11 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
tff(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(remove_pq,type,
remove_pq: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_443,negated_conjecture,
~ ! [U] :
( ! [V,W,X,Y] : ( i(triple(V,U,X)) = i(triple(W,U,Y)) )
=> ! [Z,X1,X2,X3,X4,X5] : ( i(triple(Z,insert_slb(U,pair(X4,X5)),X2)) = i(triple(X1,insert_slb(U,pair(X4,X5)),X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_co) ).
tff(f_391,axiom,
! [U,V,W,X,Y] : ( i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax55) ).
tff(c_176,plain,
! [W_183,Y_185,V_182,X_184] : ( i(triple(W_183,'#skF_5',Y_185)) = i(triple(V_182,'#skF_5',X_184)) ),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_136,plain,
! [V_148,U_147,X_150,Y_151,W_149] : ( i(triple(U_147,insert_slb(V_148,pair(X_150,Y_151)),W_149)) = insert_pq(i(triple(U_147,V_148,W_149)),X_150) ),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_174,plain,
i(triple('#skF_7',insert_slb('#skF_5',pair('#skF_10','#skF_11')),'#skF_9')) != i(triple('#skF_6',insert_slb('#skF_5',pair('#skF_10','#skF_11')),'#skF_8')),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_177,plain,
insert_pq(i(triple('#skF_7','#skF_5','#skF_9')),'#skF_10') != insert_pq(i(triple('#skF_6','#skF_5','#skF_8')),'#skF_10'),
inference(demodulation,[status(thm),theory(equality)],[c_136,c_136,c_174]) ).
tff(c_228,plain,
! [V_182,X_184] : ( insert_pq(i(triple(V_182,'#skF_5',X_184)),'#skF_10') != insert_pq(i(triple('#skF_6','#skF_5','#skF_8')),'#skF_10') ),
inference(superposition,[status(thm),theory(equality)],[c_176,c_177]) ).
tff(c_275,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_228]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV366+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.35 % Computer : n028.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 23:00:39 EDT 2023
% 0.16/0.35 % CPUTime :
% 4.08/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.08/1.98
% 4.08/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.25/2.01
% 4.25/2.01 Inference rules
% 4.25/2.01 ----------------------
% 4.25/2.01 #Ref : 1
% 4.25/2.01 #Sup : 19
% 4.25/2.01 #Fact : 2
% 4.25/2.01 #Define : 0
% 4.25/2.01 #Split : 0
% 4.25/2.01 #Chain : 0
% 4.25/2.01 #Close : 0
% 4.25/2.01
% 4.25/2.01 Ordering : KBO
% 4.25/2.01
% 4.25/2.01 Simplification rules
% 4.25/2.01 ----------------------
% 4.25/2.01 #Subsume : 9
% 4.25/2.01 #Demod : 4
% 4.25/2.01 #Tautology : 11
% 4.25/2.01 #SimpNegUnit : 0
% 4.25/2.01 #BackRed : 0
% 4.25/2.01
% 4.25/2.01 #Partial instantiations: 0
% 4.25/2.01 #Strategies tried : 1
% 4.25/2.01
% 4.25/2.01 Timing (in seconds)
% 4.25/2.01 ----------------------
% 4.25/2.01 Preprocessing : 0.67
% 4.25/2.01 Parsing : 0.34
% 4.25/2.01 CNF conversion : 0.05
% 4.25/2.01 Main loop : 0.28
% 4.25/2.01 Inferencing : 0.07
% 4.25/2.01 Reduction : 0.10
% 4.25/2.01 Demodulation : 0.07
% 4.25/2.01 BG Simplification : 0.04
% 4.25/2.01 Subsumption : 0.06
% 4.25/2.01 Abstraction : 0.02
% 4.25/2.01 MUC search : 0.00
% 4.25/2.01 Cooper : 0.00
% 4.25/2.01 Total : 1.00
% 4.25/2.01 Index Insertion : 0.00
% 4.25/2.01 Index Deletion : 0.00
% 4.25/2.01 Index Matching : 0.00
% 4.25/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------